咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是2991-3000 订阅
排序:
The longest common subsequence problem for sequences with nested arc annotations
收藏 引用
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2002年 第3期65卷 465-480页
作者: Lin, GH Chen, ZZ Jiang, T Wen, JJ Univ Calif Riverside Dept Comp Sci Riverside CA 92521 USA Univ Alberta Dept Comp Sci Edmonton AB T6G 2E8 Canada Tokyo Denki Univ Dept Math Sci Hatoyama Saitama 3500394 Japan
Arc-annotated sequences are useful in representing the structural information of RNA and protein sequences. The LONGEST ARC-PRESERVING COMMON SUBSEQUENCE (LAPCS) Problem has been introduced in Evans (algorithms and co... 详细信息
来源: 评论
algorithm for computing a convex and simple path of bounded curvature in a simple polygon
收藏 引用
algorithmICA 2002年 第2期34卷 109-156页
作者: Boissonnat, JD Ghosh, SK Kavitha, T Lazard, S INRIA PRISME F-06902 Sophia Antipolis France Tata Inst Fundamental Res Sch Comp Sci Bombay 400005 Maharashtra India INRIA Lorraine F-54602 Villers Les Nancy France
In this paper we study the collision-free path planning problem for a point robot, whose path is of bounded curvature (i.e., constrained to have curvature at most 1), moving in the plane inside an n-sided simple polyg... 详细信息
来源: 评论
An efficient distributed algorithm for constructing small dominating sets
收藏 引用
DISTRIBUTED COMPUTING 2002年 第4期15卷 193-205页
作者: Jia, LJ Rajaraman, R Suel, T Northeastern Univ Coll Comp Sci Boston MA 02115 USA Polytech Univ Dept Comp & Informat Sci Brooklyn NY 11201 USA
The dominating set problem asks for a small subset D of nodes in a graph such that every node is either in D or adjacent to a node in D. This problem arises in a number of distributed network applications, where it is... 详细信息
来源: 评论
Single machine scheduling with release dates
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2002年 第2期15卷 165-192页
作者: Goemans, MX Queyranne, M Schulz, AS Skutella, M Wang, YG MIT Dept Math Cambridge MA 02139 USA CORE Louvain Belgium Univ British Columbia Fac Commerce & Business Adm Vancouver BC V6T 1Z2 Canada MIT Alfred P Sloan Sch Management Cambridge MA 02139 USA Tech Univ Berlin Dept Math D-1000 Berlin Germany Tech Univ Berlin Inst Math Fak Math & Nat Wissensch 2 D-10623 Berlin Germany Peoplesoft Inc Pleasanton CA 94588 USA
We consider the scheduling problem of minimizing the average weighted completion time of n jobs with release dates on a single machine. We first study two linear programming relaxations of the problem, one based on a ... 详细信息
来源: 评论
A quasi-solution state evolution algorithm for channel assignment problems in cellular networks
收藏 引用
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2002年 第5期E85A卷 977-987页
作者: Funabiki, N Nakanishi, T Yokohira, T Tajima, S Higashino, T Okayama Univ Dept Commun Network Engn Okayama 7008530 Japan Osaka Univ Dept Informat & Math Sci Toyonaka Osaka 5608531 Japan
For efficient use of limited electromagnetic wave resource, the assignment of communication channels to call requests is very important in a cellular network. This task has been formulated as an NP-hard combinatorial ... 详细信息
来源: 评论
A min-max theorem on feedback vertex sets
收藏 引用
MATHEMATICS OF OPERATIONS RESEARCH 2002年 第2期27卷 361-371页
作者: Cai, MC Deng, XT Zang, WN Acad Sinica Inst Syst Sci Acad Math & Syst Sci Beijing 100080 Peoples R China City Univ Hong Kong Dept Comp Sci Hong Kong Hong Kong Peoples R China Univ Hong Kong Dept Math Hong Kong Hong Kong Peoples R China
We establish a necessary and sufficient condition for the linear system {x : Hx greater than or equal to e, x greater than or equal to 0} associated with a bipartite tournament to be totally dual integral, where H is ... 详细信息
来源: 评论
Minimizing electronic line terminals for automatic ring protection in general WDM optical networks
收藏 引用
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2002年 第1期20卷 183-189页
作者: Calinescu, G Frieder, O Wang, PJ IIT Dept Comp Sci Chicago IL 60616 USA
Automatic ring protection provides simple and rapid fault protection and restoration in telecommunication networks. To implement the automatic ring protection in general wavelength-division multiplexing (WDM) optical ... 详细信息
来源: 评论
Minimizing service and operation costs of periodic scheduling
收藏 引用
MATHEMATICS OF OPERATIONS RESEARCH 2002年 第3期27卷 518-544页
作者: Bar-Noy, A Bhatia, R Naor, JS Schieber, B Brooklyn Coll Comp & Informat Sci Dept Brooklyn NY 11210 USA Bell Labs Lucent Technol Murray Hill NJ 07974 USA Technion Dept Comp Sci IL-32000 Haifa Israel IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA
We study the problem of scheduling activities of several types under the constraint that, at most, a fixed number of activities can be scheduled in any single time slot An given activity type is associated with a serv... 详细信息
来源: 评论
Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs
收藏 引用
THEORETICAL COMPUTER SCIENCE 2002年 第1-2期276卷 33-50页
作者: Calinescu, G Wan, PJ IIT Dept Comp Sci Chicago IL 60616 USA
SONET ADMs are the dominant cost factor in the WDM/SONET rings. Recently several articles (Belvaux et al., European J. Oper. Res. 108 (1) (1998) 26-35;Calinescu and Wan, Traffic partition in WDM/SONET rings to minimiz... 详细信息
来源: 评论
Additive bounding, worst-case analysis, and the breakpoint median problem
收藏 引用
SIAM JOURNAL ON OPTIMIZATION 2002年 第2期13卷 508-519页
作者: Caprara, A Univ Bologna DEIS I-40136 Bologna Italy
We analyze the worst-case performance of a simple algorithm for the breakpoint median problem (BMP), a well-known problem in computational biology. BMP is the special case of the min-cost traveling salesman problem on... 详细信息
来源: 评论