咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是121-130 订阅
排序:
The Complexity of Finding Effectors
收藏 引用
THEORY OF COMPUTING SYSTEMS 2017年 第2期60卷 253-279页
作者: Bulteau, Laurent Fafianie, Stefan Froese, Vincent Niedermeier, Rolf Talmon, Nimrod Univ Paris Est Marne La Vallee CNRS UMR 8049 IGM LabInfo Marne La Vallee France Univ Bonn Inst Informat Bonn Germany Weizmann Inst Sci Rehovot Israel TU Berlin Inst Softwaretech & Theoret Informat Berlin Germany
The NP-hard Effectors problem on directed graphs is motivated by applications in network mining, particularly concerning the analysis of probabilistic information-propagation processes in social networks. In the corre... 详细信息
来源: 评论
A short note on Merlin-Arthur protocols for subset sum
收藏 引用
INFORMATION PROCESSING LETTERS 2017年 第Feb.期118卷 15-16页
作者: Nederlof, Jesper Tech Univ Eindhoven Dept Math & Comp Sci Eindhoven Netherlands
Given n positive integers we show how to construct a proof that the number of subsets summing to a particular integer t equals a claimed quantity. The proof is of size 0*(root t), can be constructed in 0*(t) time and ... 详细信息
来源: 评论
Tramp ship routing and scheduling with voyage separation requirements
收藏 引用
OR SPECTRUM 2017年 第4期39卷 913-943页
作者: Vilhelmsen, Charlotte Lusby, Richard M. Larsen, Jesper Tech Univ Denmark Dept Engn Management Prod TorvetBldg 426 DK-2800 Lyngby Denmark
In this paper we explore tramp ship routing and scheduling. Tramp ships operate much like taxies following the available demand. Tramp operators can determine some of their demand in advance by entering into long-term... 详细信息
来源: 评论
A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death
收藏 引用
ANNALS OF OPERATIONS RESEARCH 2017年 第1期258卷 5-30页
作者: Alvarez-Miranda, Eduardo Farhan, Hesso Luipersbeck, Martin Sinnl, Markus Univ Talca Dept Ind Engn Curico Chile Biotechnol Inst Thurgau Kreuzlingen Switzerland Univ Konstanz Dept Biol Constance Germany Univ Vienna Dept Stat & Operat Res Fac Business Econ & Stat Vienna Austria
Experimental records show the existence of a biological linkage between neuronal death and Golgi apparatus fragmentation. The comprehension of such linkage should help to understand the dynamics undergoing neurologica... 详细信息
来源: 评论
Optimization algorithms for Clique Problems
Optimization Algorithms for Clique Problems
收藏 引用
作者: Yi Zhou UNIVERSITE D'ANGERS Label europeen
学位级别:博士
This thesis considers four clique problems: the maximum vertex weight clique problem (MVWCP), the maximum s-plex problem (MsPlex), the maximum balanced biclique problem (MBBP) and the clique partitioning problem (CPP)... 详细信息
来源: 评论
On exact algorithms for Treewidth
收藏 引用
ACM TRANSACTIONS ON algorithms 2012年 第1期9卷 12-12页
作者: Bodlaender, Hans L. Fomin, Fedor V. Koster, Arie M. C. A. Kratsch, Dieter Thilikos, Dimitrios M. Univ Utrecht Dept Informat & Comp Sci NL-3508 TB Utrecht Netherlands Univ Bergen Dept Informat N-5020 Bergen Norway Univ Aachen Aachen Germany Univ Metz LITA F-507045 Metz 01 France Univ Athens GR-10679 Athens Greece
We give experimental and theoretical results on the problem of computing the treewidth of a graph by exact exponential-time algorithms using exponential space or using only polynomial space. We first report on an impl... 详细信息
来源: 评论
A note on exact and heuristic algorithms for the identical parallel machine scheduling problem
收藏 引用
JOURNAL OF HEURISTICS 2012年 第6期18卷 939-942页
作者: Dell'Amico, Mauro Iori, Manuel Martello, Silvano Monaci, Michele Univ Bologna DEIS I-40136 Bologna Italy Univ Modena & Reggio Emilia DISMI I-42122 Reggio Emilia Italy Univ Padua DEI I-35131 Padua Italy
A recent paper (Davidovic et al., J. Heuristics, 18:549-569, 2012) presented a bee colony metaheuristic for scheduling independent tasks to identical processors, evaluating its performance on a benchmark set of instan... 详细信息
来源: 评论
exact algorithms for dominating set
收藏 引用
DISCRETE APPLIED MATHEMATICS 2011年 第17期159卷 2147-2164页
作者: van Rooij, Johan M. M. Bodlaender, Hans L. Univ Utrecht Dept Informat & Comp Sci NL-3508 TB Utrecht Netherlands
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems like DOMINATING SET and INDEPENDENT SET. This approach is used in this paper to obtain a faster ... 详细信息
来源: 评论
exact and Approximation algorithms for Geometric and Capacitated Set Cover Problems
收藏 引用
ALGORITHMICA 2012年 第2期64卷 295-310页
作者: Berman, Piotr Karpinski, Marek Lingas, Andrzej Lund Univ Dept Comp Sci S-22100 Lund Sweden Penn State Univ Dept Comp Sci & Engn University Pk PA 16802 USA Univ Bonn Dept Comp Sci Bonn Germany
First, we study geometric variants of the standard set cover motivated by assignment of directional antenna and shipping with deadlines, providing the first known polynomial-time exact solutions. Next, we consider the... 详细信息
来源: 评论
The pitfalls of planar spin-glass benchmarks: raising the bar for quantum annealers (again)
收藏 引用
QUANTUM SCIENCE AND TECHNOLOGY 2017年 第3期2卷
作者: Mandra, Salvatore Katzgraber, Helmut G. Thomas, Creighton NASA Ames Res Ctr Quantum Artificial Intelligence Lab Moffett Field CA 94035 USA Stinger & Ghaffarian Technol 7701 Greenbelt RdSuite 400 Greenbelt MD 20770 USA Texas A&M Univ Dept Phys & Astron College Stn TX 77843 USA 1QB Informat Technol Vancouver BC V6B 4W4 Canada Santa Fe Inst 1399 Hyde Pk Rd Santa Fe NM 87501 USA Google Inc 111 8th Ave New York NY 10011 USA
In an effort to overcome the limitations of random spin-glass benchmarks for quantum annealers, focus has shifted to carefully crafted gadget-based problems whose logical structure typically has a planar topology. Rec... 详细信息
来源: 评论