咨询与建议

限定检索结果

文献类型

  • 156 篇 期刊文献
  • 18 篇 会议
  • 2 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 112 篇 理学
    • 101 篇 数学
    • 11 篇 物理学
    • 2 篇 化学
    • 2 篇 生物学
    • 2 篇 系统科学
    • 2 篇 统计学(可授理学、...
  • 110 篇 工学
    • 80 篇 计算机科学与技术...
    • 20 篇 软件工程
    • 16 篇 电气工程
    • 12 篇 信息与通信工程
    • 6 篇 电子科学与技术(可...
    • 5 篇 机械工程
    • 4 篇 控制科学与工程
    • 2 篇 材料科学与工程(可...
    • 2 篇 化学工程与技术
    • 1 篇 仪器科学与技术
    • 1 篇 建筑学
    • 1 篇 土木工程
    • 1 篇 石油与天然气工程
    • 1 篇 交通运输工程
    • 1 篇 生物工程
  • 32 篇 管理学
    • 32 篇 管理科学与工程(可...
    • 5 篇 工商管理
  • 7 篇 经济学
    • 5 篇 应用经济学
    • 2 篇 理论经济学
  • 1 篇 法学
    • 1 篇 法学
  • 1 篇 军事学

主题

  • 176 篇 polynomial time ...
  • 21 篇 computational co...
  • 11 篇 problem solving
  • 11 篇 np-completeness
  • 10 篇 dynamic programm...
  • 7 篇 algorithms
  • 7 篇 graph theory
  • 6 篇 graphs
  • 6 篇 approximation al...
  • 6 篇 production sched...
  • 6 篇 machine theory
  • 6 篇 polynomials
  • 6 篇 scheduling
  • 6 篇 edge-connectivit...
  • 5 篇 computer algorit...
  • 4 篇 np-hard problems
  • 4 篇 mathematical ana...
  • 4 篇 research
  • 4 篇 computer schedul...
  • 4 篇 approximation th...

机构

  • 4 篇 hiroshima univ g...
  • 4 篇 indian inst info...
  • 3 篇 univ edinburgh s...
  • 3 篇 indian inst tech...
  • 3 篇 columbia univ de...
  • 2 篇 chinese acad sci...
  • 2 篇 chinese univ hon...
  • 2 篇 microsoft corp r...
  • 2 篇 ibm tj watson re...
  • 2 篇 simon fraser uni...
  • 2 篇 simon fraser uni...
  • 2 篇 univ talca ind m...
  • 2 篇 chinese acad sci...
  • 2 篇 charles universi...
  • 2 篇 natl inst inform...
  • 2 篇 zhejiang univ co...
  • 2 篇 univ bergen dept...
  • 2 篇 arizona state un...
  • 2 篇 univ montpellier...
  • 2 篇 beijing jiaotong...

作者

  • 5 篇 panda b. s.
  • 4 篇 heggernes pinar
  • 4 篇 vijayakumar s.
  • 3 篇 dellolmo p
  • 3 篇 watanabe t
  • 3 篇 taoka satoshi
  • 3 篇 mondal joyashree
  • 3 篇 chaudhary juhi
  • 3 篇 watanabe toshima...
  • 3 篇 etessami kousha
  • 3 篇 stewart alistair
  • 3 篇 yannakakis mihal...
  • 3 篇 drozdowski m
  • 3 篇 blazewicz j
  • 2 篇 ibaraki t
  • 2 篇 hell p
  • 2 篇 yang xiaoguang
  • 2 篇 ozeki kenta
  • 2 篇 jain kamal
  • 2 篇 taoka s

语言

  • 159 篇 英文
  • 17 篇 其他
检索条件"主题词=polynomial time algorithms"
176 条 记 录,以下是141-150 订阅
排序:
The 2004 Benjamin Franklin Medal in Computer and Cognitive Science presented to Richard M. Karp
收藏 引用
JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS 2005年 第6期342卷 629-637页
作者: Char, B Drexel Univ Dept Comp Sci Philadelphia PA 19104 USA
The Benjamin Franklin Medal in Computer and Cognitive Science is awarded to Dr. Richard M. Karp for his contributions to the understanding of computational complexity. His work helps programmers find workable solution... 详细信息
来源: 评论
Establishment of survivable connections in WDM networks using partial path protection
Establishment of survivable connections in WDM networks usin...
收藏 引用
IEEE International Conference on Communications (ICC 2005)
作者: Xue, G Zhang, W Tang, J Thulasiraman, K Arizona State Univ Dept Comp Sci & Engn Tempe AZ 85287 USA
As a generalization of the traditional path protection scheme in WDM networks where a backup path is needed for each active path, the partial path protection scheme uses a collection of backup paths to protect an acti... 详细信息
来源: 评论
List partitions
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2003年 第3期16卷 449-478页
作者: Feder, T Hell, P Klein, S Motwani, R Simon Fraser Univ Sch Comp Sci Burnaby BC V5A 1S6 Canada Univ Fed Rio de Janeiro Dept Ciencia Comp IM COPPE Sistemas BR-21945970 Rio De Janeiro Brazil Stanford Univ Dept Comp Sci Stanford CA 94305 USA
List partitions generalize list colorings and list homomorphisms. (We argue that they may be called list "semihomomorphisms.") Each symmetric matrix M over 0, 1, (*) defines a list partition problem. Differe... 详细信息
来源: 评论
A 2-approximation algorithm 2-ABIS for 2-vertex- connectivity augmentation of specified vertices in a graph
收藏 引用
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2003年 第4期E86A卷 822-828页
作者: Tamura, M Taoka, S Watanabe, T Hiroshima Univ Grad Sch Engn Higashihiroshima 7398527 Japan
The 2-vertex-connectivity augmentation problem for specified vertices (2VCA-SV) is defined as follows: Given an undirected graph G = (V, E), a subgraph G(0) = (V, E') of G, a specified set of vertices S C V and a ... 详细信息
来源: 评论
Optimal multichannel data transmission in computer networks
收藏 引用
COMPUTER COMMUNICATIONS 2003年 第7期26卷 759-765页
作者: Xue, GL Arizona State Univ Dept Comp Sci & Engn Tempe AZ 85287 USA
We study end-to-end routing in a communication system where there is a bandwidth and a propagation delay associated with each link, as well as a queuing delay associated with each intermediate node. We present a polyn... 详细信息
来源: 评论
Antidirected hamiltonian paths between specified vertices of a tournament
收藏 引用
DISCRETE APPLIED MATHEMATICS 2002年 第1-3期117卷 87-98页
作者: Hell, P Rosenfeld, M Simon Fraser Univ Sch Comp Sci Dept Comp Sci Burnaby BC V5A 1S6 Canada Univ Washington Comp & Software Syst Program Tacoma WA 98402 USA
We prove that in any tournament there is an antidirected hamiltonian path from a specified first vertex to a specified last vertex, and starting with an arc of specified direction, as long as both the first vertex and... 详细信息
来源: 评论
Cyclic scheduling in a robotic production line
收藏 引用
JOURNAL OF SCHEDULING 2002年 第1期5卷 23-41页
作者: Kats, V Levner, E Holon Inst Technol Dept Comp Sci IL-58102 Holon Israel Technion Israel Inst Technol Fac Ind Engn & Management IL-32000 Haifa Israel
The solution of cyclic scheduling problems is part of the classical repertoire on scheduling algorithms. We consider a problem of cyclic scheduling of identical parts in a production line where transportation of the p... 详细信息
来源: 评论
Graph connectivity and its augmentation: applications of MA orderings
收藏 引用
DISCRETE APPLIED MATHEMATICS 2002年 第1-3期123卷 447-472页
作者: Nagamochi, H Ibaraki, T Toyohashi Univ Technol Dept Informat & Comp Sci Tenpa Ku Toyohashi Aichi 4418580 Japan Kyoto Univ Dept Appl Math & Phys Sakyo Ku Kyoto 6068501 Japan
This paper surveys how the maximum adjacency (MA) ordering of the vertices in a graph can be used to solve various graph problems. We first explain that the minimum cut problem can be solved efficiently by utilizing t... 详细信息
来源: 评论
Symbolic pointer analysis  02
Symbolic pointer analysis
收藏 引用
International Conference on Computer-Aided Design
作者: Zhu, JW Univ Toronto Dept Elect & Comp Engn Toronto ON M5S 3G4 Canada
One of the bottlenecks in the recent movement of hardware synthesis from behavioral C programs is the difficulty in reasoning about runtime pointer values at compile time. The pointer analysis problem has been investi... 详细信息
来源: 评论
A distributed algorithm of efficient core discipline on weighted bipartite networks
收藏 引用
COMPUTER SYSTEMS SCIENCE AND ENGINEERING 2002年 第1期17卷 13-22页
作者: Yang, SJ Soochow Univ Dept Comp & Informat Sci Taipei Taiwan
A core of a network is the path that selects one efficient link from all given measured paths. Thus, finding the efficient core is the key issue to a bipartite network. in this paper, we propose the distributed algori... 详细信息
来源: 评论