咨询与建议

限定检索结果

文献类型

  • 2,431 篇 期刊文献
  • 770 篇 会议
  • 24 篇 学位论文
  • 4 册 图书

馆藏范围

  • 3,229 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 2,348 篇 工学
    • 2,007 篇 计算机科学与技术...
    • 477 篇 电气工程
    • 380 篇 信息与通信工程
    • 337 篇 软件工程
    • 76 篇 机械工程
    • 74 篇 控制科学与工程
    • 68 篇 电子科学与技术(可...
    • 29 篇 交通运输工程
    • 28 篇 仪器科学与技术
    • 11 篇 材料科学与工程(可...
    • 8 篇 土木工程
    • 6 篇 力学(可授工学、理...
    • 6 篇 测绘科学与技术
    • 6 篇 石油与天然气工程
    • 6 篇 生物工程
    • 3 篇 环境科学与工程(可...
  • 1,652 篇 理学
    • 1,598 篇 数学
    • 28 篇 生物学
    • 25 篇 统计学(可授理学、...
    • 19 篇 物理学
    • 12 篇 系统科学
    • 10 篇 化学
    • 3 篇 地球物理学
  • 897 篇 管理学
    • 890 篇 管理科学与工程(可...
    • 235 篇 工商管理
    • 5 篇 图书情报与档案管...
  • 242 篇 经济学
    • 235 篇 应用经济学
    • 6 篇 理论经济学
  • 10 篇 法学
    • 8 篇 法学
  • 9 篇 医学
    • 5 篇 临床医学
  • 8 篇 军事学
  • 4 篇 农学
  • 2 篇 艺术学
  • 1 篇 教育学

主题

  • 3,229 篇 approximation al...
  • 222 篇 scheduling
  • 80 篇 combinatorial op...
  • 73 篇 approximation al...
  • 68 篇 np-hard
  • 68 篇 computational co...
  • 65 篇 np-hardness
  • 64 篇 linear programmi...
  • 61 篇 np-complete
  • 56 篇 optimization
  • 53 篇 facility locatio...
  • 51 篇 traveling salesm...
  • 51 篇 graph algorithm
  • 46 篇 wireless sensor ...
  • 45 篇 worst-case analy...
  • 45 篇 vertex cover
  • 45 篇 makespan
  • 45 篇 network design
  • 43 篇 computational ge...
  • 43 篇 dynamic programm...

机构

  • 52 篇 univ alberta dep...
  • 50 篇 univ texas dalla...
  • 38 篇 shandong jianzhu...
  • 37 篇 iit dept comp sc...
  • 37 篇 nanjing univ sta...
  • 34 篇 tianjin univ tec...
  • 33 篇 city univ hong k...
  • 32 篇 univ new brunswi...
  • 31 篇 shandong normal ...
  • 29 篇 shandong univ sc...
  • 27 篇 renmin univ chin...
  • 24 篇 yunnan univ sch ...
  • 24 篇 chinese acad sci...
  • 23 篇 hangzhou dianzi ...
  • 20 篇 beijing univ tec...
  • 18 篇 zhejiang normal ...
  • 17 篇 beijing univ tec...
  • 17 篇 beijing univ tec...
  • 17 篇 univ wisconsin d...
  • 16 篇 univ texas dalla...

作者

  • 92 篇 xu dachuan
  • 52 篇 du donglei
  • 49 篇 wu weili
  • 47 篇 lin guohui
  • 44 篇 wu chenchen
  • 44 篇 zhang zhao
  • 42 篇 li deying
  • 34 篇 zhang dongmei
  • 30 篇 li min
  • 30 篇 du ding-zhu
  • 29 篇 chen yong
  • 28 篇 zhang an
  • 27 篇 yu wei
  • 25 篇 dai haipeng
  • 25 篇 liu zhaohui
  • 25 篇 wang wei
  • 25 篇 li weidong
  • 25 篇 chen guihai
  • 24 篇 dumitrescu adria...
  • 24 篇 zhang peng

语言

  • 3,001 篇 英文
  • 214 篇 其他
  • 13 篇 中文
  • 2 篇 法文
  • 1 篇 德文
检索条件"主题词=Approximation algorithm"
3229 条 记 录,以下是3051-3060 订阅
排序:
A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
收藏 引用
THEORETICAL COMPUTER SCIENCE 2000年 第1-2期237卷 105-122页
作者: Schuurman, P Woeginger, GJ Graz Univ Technol Inst Math B A-8010 Graz Austria Eindhoven Univ Technol Dept Math & Comp Sci NL-5600 MB Eindhoven Netherlands
In this paper we investigate the two-stage multiprocessor flow shop scheduling problem F2(P)\ . \C-max, where the numbers m(1) and m(2) of machines available in the two stages are part of the input. We demonstrate the... 详细信息
来源: 评论
Polynomial time approximation scheme for the rectilinear Steiner arborescence problem
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2000年 第3期4卷 357-363页
作者: Lu, B Ruan, L Univ Minnesota Dept Comp Sci Minneapolis MN 55455 USA
Given a set N of n terminals in the first quadrant of the Euclidean plane E-2, find a minimum length directed tree rooted at the origin o, connecting to all terminals in N, and consisting of only horizontal and vertic... 详细信息
来源: 评论
A more efficient approximation scheme for tree alignment
收藏 引用
SIAM JOURNAL ON COMPUTING 2000年 第1期30卷 283-299页
作者: Wang, LS Jiang, T Gusfield, D City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China Univ Calif Riverside Dept Comp Sci Riverside CA 92521 USA Univ Washington Seattle WA 98195 USA Univ Calif Davis Dept Comp Sci Davis CA 95616 USA
We present a new polynomial time approximation scheme (PTAS) for tree alignment, which is an important variant of multiple sequence alignment. As in the existing PTASs in the literature, the basic approach of our algo... 详细信息
来源: 评论
On Graham's bound for cyclic scheduling
收藏 引用
PARALLEL COMPUTING 2000年 第9期26卷 1163-1174页
作者: Chrétienne, P Univ Paris 06 Lab LIP6 F-75252 Paris 05 France
This paper addresses the performance of list scheduling a cyclic set of N non-preemptive dependent generic tasks on m identical processors. The reduced precedence graph is assumed to be strongly connected but the numb... 详细信息
来源: 评论
Approximating minimum feedback vertex sets in hypergraphs
收藏 引用
THEORETICAL COMPUTER SCIENCE 2000年 第1-2期246卷 107-116页
作者: Fujito, T Hiroshima Univ Dept Elect Engn Higashihiroshima 7398527 Japan
The feedback vertex set problem for hypergraphs is considered and an efficient approximation algorithm is presented. It is shown that an approximation factor of k is guaranteed when the cardinality of every hyperedge ... 详细信息
来源: 评论
Scheduling UET task systems with concurrency on two parallel identical processors
收藏 引用
MATHEMATICAL METHODS OF OPERATIONS RESEARCH 2000年 第3期52卷 369-387页
作者: Brucker, P Knust, S Roper, D Zinder, Y Univ Osnabruck Fachbereich Math Informat D-49069 Osnabruck Germany Univ Western Sydney Nepean Dept Math Kingswood NSW 2747 Australia Univ Technol Sydney Sch Math Sci Sydney NSW 2007 Australia
Problems with unit execution time tasks and two identical parallel processors have received a great deal of attention in scheduling theory. In contrast to the conventional models, where each task requires only one pro... 详细信息
来源: 评论
An optimal algorithm for Monte Carlo estimation
收藏 引用
SIAM JOURNAL ON COMPUTING 2000年 第5期29卷 1484-1496页
作者: Dagum, P Karp, R Luby, M Ross, S Stanford Univ Sch Med Sect Med Informat Stanford CA 94305 USA Int Comp Sci Inst Berkeley CA 94704 USA Univ Calif Berkeley Div Comp Sci Berkeley CA 94704 USA Univ Calif Berkeley Dept Ind Engn & Operat Res Berkeley CA 94704 USA
A typical approach to estimate an unknown quantity mu is to design an experiment that produces a random variable Z distributed in [0, 1] with E[Z] = mu, run this experiment independently a number of times, and use the... 详细信息
来源: 评论
Optimal information gathering on the Internet with time and cost constraints
收藏 引用
SIAM JOURNAL ON COMPUTING 2000年 第5期29卷 1596-1620页
作者: Etzioni, O Hanks, S Jiang, T Madani, O Univ Washington Dept Comp Sci & Engn Seattle WA 98195 USA Univ Calif Riverside Dept Comp Sci Riverside CA 92521 USA
The World Wide Web provides access to vast amounts of information, but content providers are considering charging for the information and services they supply. Thus the consumer may face the problem of balancing the b... 详细信息
来源: 评论
On a cutting plane heuristic for the stable roommates problem and its applications
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2000年 第1期123卷 195-205页
作者: Teo, CP Sethuraman, J Natl Univ Singapore Fac Business Adm Dept Decis Sci Singapore 119260 Singapore MIT Ctr Operat Res Cambridge MA 02139 USA
We propose a new cutting plane heuristic for the classical stable roommates problem. Our approach utilises a new linear programming formulation for the problem, and the underlying geometric properties of the fractiona... 详细信息
来源: 评论
Fixed topology alignment with recombination
收藏 引用
DISCRETE APPLIED MATHEMATICS 2000年 第1-3期104卷 281-300页
作者: Wang, LS Ma, B Li, M City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China Peking Univ Dept Math Beijing 100871 Peoples R China Univ Waterloo Dept Comp Sci Waterloo ON N2L 3G1 Canada
In this paper, we study a new version of multiple sequence alignment, fixed topology alignment with recombination. We show that it cannot be approximated within any constant ratio unless P = NP. For a restricted versi... 详细信息
来源: 评论