咨询与建议

限定检索结果

文献类型

  • 230 篇 期刊文献
  • 64 篇 会议
  • 2 篇 学位论文
  • 1 册 图书

馆藏范围

  • 297 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 208 篇 工学
    • 177 篇 计算机科学与技术...
    • 35 篇 软件工程
    • 21 篇 电气工程
    • 9 篇 信息与通信工程
    • 8 篇 交通运输工程
    • 5 篇 电子科学与技术(可...
    • 5 篇 控制科学与工程
    • 4 篇 机械工程
    • 3 篇 土木工程
    • 3 篇 生物医学工程(可授...
    • 2 篇 核科学与技术
    • 2 篇 生物工程
    • 1 篇 力学(可授工学、理...
    • 1 篇 冶金工程
    • 1 篇 网络空间安全
  • 158 篇 理学
    • 146 篇 数学
    • 10 篇 生物学
    • 9 篇 统计学(可授理学、...
    • 4 篇 物理学
    • 2 篇 化学
  • 97 篇 管理学
    • 96 篇 管理科学与工程(可...
    • 9 篇 工商管理
  • 15 篇 经济学
    • 11 篇 应用经济学
    • 4 篇 理论经济学
  • 6 篇 法学
    • 4 篇 法学
    • 2 篇 社会学
  • 3 篇 军事学
  • 2 篇 教育学
    • 2 篇 心理学(可授教育学...
  • 2 篇 农学
  • 1 篇 医学
    • 1 篇 临床医学
    • 1 篇 特种医学

主题

  • 297 篇 exact algorithms
  • 20 篇 graph algorithms
  • 19 篇 heuristics
  • 18 篇 parameterized co...
  • 16 篇 combinatorial op...
  • 15 篇 approximation al...
  • 14 篇 parameterized al...
  • 14 篇 scheduling
  • 10 篇 vehicle routing
  • 9 篇 fixed-parameter ...
  • 9 篇 dynamic programm...
  • 8 篇 np-hardness
  • 8 篇 complexity
  • 7 篇 maximum satisfia...
  • 6 篇 traveling salesm...
  • 6 篇 metaheuristics
  • 6 篇 survey
  • 6 篇 dominating set
  • 6 篇 treewidth
  • 6 篇 steiner tree

机构

  • 8 篇 univ elect sci &...
  • 6 篇 univ bergen dept...
  • 6 篇 univ tubingen wi...
  • 5 篇 univ bologna dei...
  • 5 篇 lund univ dept c...
  • 5 篇 univ jena inst i...
  • 4 篇 univ utrecht ins...
  • 4 篇 maastricht univ ...
  • 4 篇 univ utrecht dep...
  • 4 篇 tu berlin inst s...
  • 3 篇 univ warsaw inst...
  • 3 篇 univ utrecht dep...
  • 3 篇 univ talca dept ...
  • 3 篇 univ bologna dei...
  • 3 篇 univ bergen dept...
  • 3 篇 nyu dept comp sc...
  • 3 篇 univ elect sci &...
  • 3 篇 univ warsaw wars...
  • 3 篇 lebanese amer un...
  • 3 篇 florida state un...

作者

  • 12 篇 bodlaender hans ...
  • 11 篇 niedermeier rolf
  • 10 篇 xiao mingyu
  • 8 篇 van rooij johan ...
  • 8 篇 niedermeier r
  • 7 篇 delorme maxence
  • 6 篇 nederlof jesper
  • 6 篇 vigo daniele
  • 6 篇 fomin fedor v.
  • 5 篇 guo j
  • 5 篇 kratsch dieter
  • 5 篇 monaci michele
  • 5 篇 liedloff mathieu
  • 5 篇 gramm j
  • 5 篇 bredereck robert
  • 4 篇 pilipczuk marcin
  • 4 篇 iori manuel
  • 4 篇 sorge manuel
  • 4 篇 chen jiehua
  • 4 篇 nagamochi hirosh...

语言

  • 274 篇 英文
  • 23 篇 其他
检索条件"主题词=Exact Algorithms"
297 条 记 录,以下是131-140 订阅
排序:
Computing exact clustering posteriors with subset convolution
收藏 引用
COMMUNICATIONS IN STATISTICS-THEORY AND METHODS 2016年 第10期45卷 3048-3058页
作者: Kohonen, Jukka Corander, Jukka Univ Helsinki Dept Math & Stat POB 68 FI-00014 Helsinki Finland
An exponential-time exact algorithm is provided for the task of clustering n items of data into k clusters. Instead of seeking one partition, posterior probabilities are computed for summary statistics: the number of ... 详细信息
来源: 评论
Optimal placement of multiple types of detectors under a small vessel attack threat to port security
收藏 引用
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW 2016年 93卷 71-94页
作者: Yan, Xihong Nie, Xiaofeng Taiyuan Normal Univ Higher Educ Key Lab Engn & Sci Comp Taiyuan 030012 Peoples R China Nanyang Technol Univ Sch Mech & Aerosp Engn Singapore 639798 Singapore
We focus on a threat scenario where a terrorist would utilize a small vessel to attack a maritime target. We consider how to place multiple types of detectors to protect maritime targets from such an attack. Detectors... 详细信息
来源: 评论
H-index manipulation by merging articles: Models, theory, and experiments
收藏 引用
ARTIFICIAL INTELLIGENCE 2016年 第0期240卷 19-35页
作者: van Bevern, Rene Komusiewicz, Christian Niedermeier, Rolf Sorge, Manuel Walsh, Toby Novosibirsk State Univ Ul Pirogova 2 Novosibirsk 630090 Russia Russian Acad Sci Siberian Branch Sobolev Inst Math Novosibirsk Russia Univ Jena Inst Informat D-07745 Jena Germany TU Berlin Inst Softwaretech & Theoret Informat Berlin Germany Univ New South Wales Sydney NSW Australia Data61 Sydney NSW Australia
An author's profile on Google Scholar consists of indexed articles and associated data, such as the number of citations and the H-index. The author is allowed to merge articles;this may affect the H-index. We anal... 详细信息
来源: 评论
BOUNDING THE RUNNING TIME OF algorithms FOR SCHEDULING AND PACKING PROBLEMS
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2016年 第1期30卷 343-366页
作者: Jansen, K. Land, F. Land, K. Univ Kiel Inst Informat Olshausenstr 40 D-24098 Kiel Germany
Our goal is to show tight bounds on the running time of algorithms for scheduling and packing problems. To prove lower bounds, we investigate implications of the exponential time hypothesis on such algorithms. For exa... 详细信息
来源: 评论
Shortest color-spanning intervals
收藏 引用
THEORETICAL COMPUTER SCIENCE 2016年 第Part3期609卷 561-568页
作者: Jiang, Minghui Wang, Haitao Utah State Univ Dept Comp Sci Logan UT 84322 USA
Given a set of n points on a line, where each point has one of k colors, and given an integer si >= 1 for each color i, 1 = 1. We also obtain some interesting results for the general problem SCSI-t. From the negati... 详细信息
来源: 评论
An exact approach for Complete Test Set Generation of Toffoli-Fredkin-Peres based Reversible Circuits
收藏 引用
JOURNAL OF ELECTRONIC TESTING-THEORY AND APPLICATIONS 2016年 第2期32卷 175-196页
作者: Nagamani, A. N. Ashwin, S. Abhishek, B. Agrawal, V. K. PES Inst Technol Dept ECE PES Univ Campus Bangalore Karnataka India PES Inst Technol Dept Informat Sci & Engn PES Univ Campus Bangalore Karnataka India
Reversible logic has gained interest of researchers worldwide for its ultra-low power and high speed computing abilities in the future quantum information processing. Testing of these circuits is important for ensurin... 详细信息
来源: 评论
Extending Lifetime Through Partial Coverage And Roles Allocation in Connectivity-Constrained Sensor Networks
收藏 引用
IFAC-PapersOnLine 2016年 第12期49卷 973-978页
作者: Carrabs, Francesco Cerulli, Raffaele D'Ambrosio, Ciriaco Raiconi, Andrea Department of Mathematics University of Salerno Via Giovanni Paolo II 132 Fisciano84084 Italy
We consider a scenario in which certain target locations are monitored through sensors, which are scattered all over a considered area. A quality-of-service threshold imposes that, at any given time, a predefined perc... 详细信息
来源: 评论
Dominating set based exact algorithms for 3-coloring
收藏 引用
INFORMATION PROCESSING LETTERS 2011年 第6期111卷 251-255页
作者: Narayanaswamy, N. S. Subramanian, C. R. Inst Math Sci Madras 600113 Tamil Nadu India IIT Madras Dept CSE Madras Tamil Nadu India
We show that the 3-colorability problem can be solved in O(1.296(n)) time on any n-vertex graph with minimum degree at least 15. This algorithm is obtained by constructing a dominating set of the graph greedily, enume... 详细信息
来源: 评论
Solving Rank-Constrained Semidefinite Programs in exact Arithmetic  16
Solving Rank-Constrained Semidefinite Programs in Exact Arit...
收藏 引用
41st ACM International Symposium on Symbolic and Algebraic Computation (ISSAC)
作者: Naldi, Simone Fields Inst Res Math Sci 222 Coll St Toronto ON M5T 3J1 Canada
We consider the problem of minimizing a linear function over an affine section of the cone of positive semidefinite matrices, with the additional constraint that the feasible matrix has prescribed rank. When the rank ... 详细信息
来源: 评论
Color Spanning Objects: algorithms and Hardness Results  2nd
Color Spanning Objects: Algorithms and Hardness Results
收藏 引用
2nd International Conference on algorithms and Discrete Applied Mathematics (CALDAM)
作者: Banerjee, Sandip Misra, Neeldhara Nandy, Subhas C. Indian Stat Inst Kolkata India Indian Inst Technol Gandhinagar India
In this paper, we study the Shortest Color Spanning Intervals problem, and related generalizations, namely Smallest Color Spanning t Squares and Smallest Color Spanning t Circles. The generic setting is the following:... 详细信息
来源: 评论