咨询与建议

限定检索结果

文献类型

  • 385 篇 期刊文献
  • 27 篇 会议
  • 4 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 299 篇 理学
    • 294 篇 数学
    • 12 篇 统计学(可授理学、...
    • 2 篇 化学
    • 2 篇 生物学
    • 2 篇 系统科学
    • 1 篇 物理学
  • 184 篇 工学
    • 124 篇 计算机科学与技术...
    • 44 篇 软件工程
    • 27 篇 控制科学与工程
    • 18 篇 电气工程
    • 14 篇 机械工程
    • 8 篇 信息与通信工程
    • 5 篇 仪器科学与技术
    • 3 篇 动力工程及工程热...
    • 3 篇 电子科学与技术(可...
    • 3 篇 石油与天然气工程
    • 2 篇 化学工程与技术
    • 1 篇 土木工程
    • 1 篇 测绘科学与技术
    • 1 篇 交通运输工程
    • 1 篇 生物工程
  • 151 篇 管理学
    • 148 篇 管理科学与工程(可...
    • 16 篇 工商管理
    • 1 篇 图书情报与档案管...
  • 16 篇 经济学
    • 13 篇 应用经济学
    • 3 篇 理论经济学
  • 7 篇 教育学
    • 7 篇 心理学(可授教育学...
  • 1 篇 法学
    • 1 篇 社会学
  • 1 篇 农学
  • 1 篇 军事学

主题

  • 416 篇 polynomial algor...
  • 37 篇 complexity
  • 27 篇 scheduling
  • 17 篇 np-completeness
  • 15 篇 linear programmi...
  • 13 篇 dynamic programm...
  • 12 篇 np-complete
  • 11 篇 computational co...
  • 11 篇 combinatorial op...
  • 10 篇 stable set
  • 10 篇 kernel function
  • 9 篇 np-hardness
  • 8 篇 graph
  • 8 篇 matching
  • 7 篇 graphs
  • 7 篇 tree
  • 6 篇 longest path pro...
  • 6 篇 interior-point m...
  • 6 篇 independent set
  • 6 篇 hamiltonian cycl...

机构

  • 9 篇 univ southern de...
  • 8 篇 rutgers state un...
  • 8 篇 pusan natl univ ...
  • 6 篇 dongseo univ dep...
  • 5 篇 univ so denmark ...
  • 5 篇 univ southern de...
  • 5 篇 univ toronto div...
  • 5 篇 univ nizhny novg...
  • 4 篇 univ paris 09 la...
  • 4 篇 inst engn cybern...
  • 4 篇 kyoto univ grad ...
  • 4 篇 univ johannesbur...
  • 4 篇 belarusian state...
  • 4 篇 univ ioannina de...
  • 3 篇 beijing inst tec...
  • 3 篇 odense univ dept...
  • 3 篇 moscow mv lomono...
  • 3 篇 lomonosov moscow...
  • 3 篇 univ primorska u...
  • 3 篇 eotvos lorand un...

作者

  • 13 篇 lozin vv
  • 11 篇 bang-jensen jorg...
  • 9 篇 nagamochi h
  • 8 篇 mertzios george ...
  • 8 篇 cho gyeong-mi
  • 7 篇 ibaraki t
  • 7 篇 hansen p
  • 6 篇 averbakh igor
  • 6 篇 jaumard b
  • 6 篇 bang-jensen j.
  • 6 篇 bang-jensen j
  • 6 篇 gerber mu
  • 5 篇 hertz a
  • 5 篇 averbakh i
  • 5 篇 levner eugene
  • 5 篇 yeo anders
  • 5 篇 woeginger gj
  • 4 篇 tao yuegang
  • 4 篇 tuza z
  • 4 篇 chu chengbin

语言

  • 336 篇 英文
  • 77 篇 其他
  • 3 篇 中文
  • 1 篇 德文
  • 1 篇 法文
检索条件"主题词=Polynomial algorithm"
416 条 记 录,以下是381-390 订阅
排序:
The Howard-Romanovskii Routing algorithm Revisited, with Applications to Robot Scheduling
The Howard-Romanovskii Routing Algorithm Revisited, with App...
收藏 引用
International Conference on Computers and Industrial Engineering (CIE39)
作者: Kats, Vladimir Levner, Eugene Inst Ind Math Beer Sheva Israel Holon & Bar Dan Univ Holon Inst Technol Ramat Gan Israel
We consider the original routing algorithm invented by Romanovskii (1967) for solving a cyclic project scheduling problem and establish its close relationship with the well-known routing algorithm by Dantzig, Blattner... 详细信息
来源: 评论
Max-Plus Matrix Method for Correctness Verification of Communication Protocols  15th
Max-Plus Matrix Method for Correctness Verification of Commu...
收藏 引用
15th IFAC Workshop on Discrete Event Systems (WODES)
作者: Wang, Cailu Tao, Yuegang Tan, Jianguo Beijing Inst Technol Sch Automat Beijing 100081 Peoples R China Hebei Univ Technol Sch Artificial Intelligence Tianjin 300130 Peoples R China Handan Inst Environm Protect Handan 056001 Peoples R China
Accompanied with the mushroom growth of communication technology, the correct operation of protocols has been widely concerned and studied in the field of communication. The correctness verification is a difficult pro... 详细信息
来源: 评论
An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
An approximation for finding a smallest 2-edge-connected sub...
收藏 引用
5th Annual International Computing and Combinatorics Conference
作者: Nagamochi, H Toyohashi Univ Technol Dept Informat & Comp Sci Tempa Ku Toyohashi Aichi 418580 Japan
Given a graph G = (V, E) and a tree T = (V, F) with E boolean AND F = phi such that G + T = (V, F boolean OR E) is 2-edge-connected, we consider the problem of finding a smallest 2-edge-connected spanning subgraph (V,... 详细信息
来源: 评论
Sensor Networks for Structural Health Monitoring of Critical Infrastructures Using Identifying Codes  15
Sensor Networks for Structural Health Monitoring of Critical...
收藏 引用
15th International Conference on the Design of Reliable Communication Networks (DRCN)
作者: Basu, Kaustav Dey, Sanjana Nandy, Subhas Sen, Arunabha Arizona State Univ NetXT Lab Tempe AZ 85287 USA Indian Stat Inst Kolkata India
The Structural Health Monitoring (SHM) problem for critical infrastructures using wireless sensor networks (WSN), has received considerable attention in the research community in recent years. Sensors placed in these ... 详细信息
来源: 评论
An algorithm for node-to-set disjoint paths problem in burnt pancake graphs
An algorithm for node-to-set disjoint paths problem in burnt...
收藏 引用
9th Pacific Rim International Symposium on Dependable Computing
作者: Kaneko, K Tokyo Univ Agr & Technol Fac Technol Koganei Tokyo 1848588 Japan
A burnt pancake graph is a variant of Cayley graphs and its topology is suitable for massively parallel systems. However, for a burnt pancake graph, there is much room for further research. Hence, in this study, we fo... 详细信息
来源: 评论
Bichromatic triangle games
收藏 引用
Electronic Notes in Discrete Mathematics 2011年 第C期37卷 105-110页
作者: Manić, Gordana Martin, Daniel M. Stojakoviš, Miloć Centro de Matemática Computação e Cognição Universidade Federal do ABC São Paulo Brazil Department of Mathematics and Informatics University of Novi Sad Serbia
We study a combinatorial game called Bichromatic Triangle Game, defined as follows. Two players R and B construct a triangulation on a given planar point set V. Starting from no edges, players R and B take turns drawi... 详细信息
来源: 评论
Classification Problems for MDPs and Optimal Customer Admission to M/M/k/N Queues
Classification Problems for MDPs and Optimal Customer Admiss...
收藏 引用
作者: Fenghsu Yang Stony Brook University
学位级别:博士
My dissertation addresses the unichain classification problem for any finite Markov decision process (MDP) with a recurrent or stop- ping state and the optimal admission problem for an M/M/k/N queue with holding costs... 详细信息
来源: 评论
Scheduling open shops with parallel machines
收藏 引用
Operations Research Letters 1982年 第4期1卷 161-164页
作者: Lawler, E.L. Luby, M.G. Vazirani, V.V. Computer Science Division University of California Berkeley CA 94720 United States
The parallel shop and the open shop are two machine environments that have received much attention in the literature of scheduling theory. A common generalization-the open shop with parallel machines-is considered in ... 详细信息
来源: 评论
Cluster-Fault-Tolerant Routing in Burnt Pancake Graphs
Cluster-Fault-Tolerant Routing in Burnt Pancake Graphs
收藏 引用
10th International Conference on algorithms and Architectures for Parallel Processing
作者: Iwasawa, Nagateru Watanabe, Tatsuro Iwasaki, Tatsuya Kaneko, Keiichi Tokyo Univ Agr & Technol Grad Sch Engn Koganei Tokyo Japan
This paper proposes a routing algorithm in an n-burnt pancake graph B(n), which is a topology for interconnection networks, with at most n - 1 faulty clusters whose diameters are at most 3. For an arbitrary pair of no... 详细信息
来源: 评论
Probabilistické algoritmy pro prvočíselnost
Probabilistické algoritmy pro prvočíselnost
收藏 引用
作者: Tejkalová, Natálie Charles University of Prague
Attention has been paid mostly to the new deterministic algorithm for primality testing AKS recently. However, probabilistic algorithms remain an efficient tool for primality testing. Our thesis focuses mostly on two ... 详细信息
来源: 评论