咨询与建议

限定检索结果

文献类型

  • 22,831 篇 会议
  • 9,109 篇 期刊文献
  • 64 篇 学位论文
  • 1 册 图书

馆藏范围

  • 32,005 篇 电子文献
  • 1 种 纸本馆藏

日期分布

学科分类号

  • 16,009 篇 工学
    • 10,099 篇 计算机科学与技术...
    • 4,880 篇 电气工程
    • 3,123 篇 软件工程
    • 2,683 篇 信息与通信工程
    • 1,951 篇 控制科学与工程
    • 738 篇 机械工程
    • 680 篇 电子科学与技术(可...
    • 605 篇 航空宇航科学与技...
    • 532 篇 仪器科学与技术
    • 229 篇 交通运输工程
    • 212 篇 材料科学与工程(可...
    • 195 篇 化学工程与技术
    • 171 篇 生物工程
    • 153 篇 测绘科学与技术
    • 135 篇 土木工程
    • 134 篇 生物医学工程(可授...
    • 133 篇 动力工程及工程热...
  • 10,438 篇 理学
    • 9,373 篇 数学
    • 874 篇 物理学
    • 766 篇 系统科学
    • 738 篇 统计学(可授理学、...
    • 265 篇 生物学
    • 235 篇 化学
    • 126 篇 地球物理学
  • 2,489 篇 管理学
    • 1,926 篇 管理科学与工程(可...
    • 673 篇 工商管理
    • 557 篇 图书情报与档案管...
  • 418 篇 经济学
    • 387 篇 应用经济学
  • 211 篇 医学
    • 175 篇 临床医学
  • 180 篇 法学
    • 167 篇 社会学
  • 128 篇 文学
  • 128 篇 农学
  • 37 篇 教育学
  • 27 篇 军事学
  • 11 篇 艺术学
  • 1 篇 哲学
  • 1 篇 历史学

主题

  • 32,005 篇 approximation al...
  • 2,737 篇 algorithm design...
  • 2,342 篇 optimization
  • 2,306 篇 approximation me...
  • 2,165 篇 heuristic algori...
  • 1,423 篇 linear programmi...
  • 1,409 篇 convergence
  • 1,277 篇 computational mo...
  • 1,216 篇 resource managem...
  • 1,140 篇 signal processin...
  • 957 篇 computer science
  • 914 篇 polynomials
  • 908 篇 clustering algor...
  • 906 篇 complexity theor...
  • 789 篇 mathematical mod...
  • 745 篇 vectors
  • 712 篇 programming
  • 648 篇 estimation
  • 614 篇 transportation
  • 612 篇 training

机构

  • 97 篇 univ maryland de...
  • 70 篇 technion israel ...
  • 55 篇 univ waterloo de...
  • 49 篇 cornell univ dep...
  • 43 篇 tsinghua univers...
  • 39 篇 national institu...
  • 39 篇 carnegie mellon ...
  • 38 篇 iit dept comp sc...
  • 35 篇 national mobile ...
  • 34 篇 shandong univ sc...
  • 32 篇 sichuan univ col...
  • 31 篇 school of comput...
  • 31 篇 nanjing univ sta...
  • 29 篇 univ chinese aca...
  • 29 篇 technion haifa
  • 29 篇 princeton univ p...
  • 29 篇 suny stony brook...
  • 28 篇 epfl
  • 28 篇 hong kong polyte...
  • 28 篇 tel aviv univers...

作者

  • 64 篇 woodruff david p...
  • 64 篇 ravi r.
  • 52 篇 kortsarz guy
  • 45 篇 lee euiwoong
  • 43 篇 levin asaf
  • 41 篇 chan timothy m.
  • 40 篇 kumar amit
  • 37 篇 chen zhi-zhong
  • 36 篇 friggstad zachar...
  • 33 篇 kawarabayashi ke...
  • 32 篇 manurangsi pasin
  • 32 篇 chalermsook pari...
  • 31 篇 wang lusheng
  • 30 篇 gudmundsson joac...
  • 29 篇 thai my t.
  • 29 篇 williamson david...
  • 29 篇 carmi paz
  • 29 篇 zenklusen rico
  • 28 篇 saha barna
  • 27 篇 dinitz michael

语言

  • 31,281 篇 英文
  • 575 篇 其他
  • 114 篇 中文
  • 9 篇 日文
  • 7 篇 俄文
  • 4 篇 法文
  • 2 篇 西班牙文
  • 1 篇 德文
  • 1 篇 葡萄牙文
  • 1 篇 土耳其文
检索条件"主题词=Approximation algorithms"
32005 条 记 录,以下是221-230 订阅
approximation algorithms for pick-and-place robots
收藏 引用
ANNALS OF OPERATIONS RESEARCH 2001年 第1-4期107卷 321-338页
作者: Srivastav, A Schroeter, H Michel, C Univ Kiel Math Seminar D-24098 Kiel Germany Univ Bonn Inst Informat D-53113 Bonn Germany Commerzbank AG ZHI Risc Management Controlling D-60261 Frankfurt Germany
In this paper we study the problem of finding placement tours for pick-and-place robots, also known as the printed circuit board assembly problem with m positions on a board, n bins containing In components and n loca... 详细信息
来源: 评论
approximation algorithms for spanner problems and Directed Steiner Forest
收藏 引用
INFORMATION AND COMPUTATION 2013年 222卷 93-107页
作者: Berman, Piotr Bhattacharyya, Arnab Makarychev, Konstantin Raskhodnikova, Sofya Yaroslavtsev, Grigory Penn State Univ University Pk PA 16802 USA Princeton Univ Princeton NJ 08540 USA Microsoft Res Redmond WA 98052 USA
We present an O(root n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse subgraph that approximately preserves d... 详细信息
来源: 评论
approximation algorithms FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM WITH DISCRETE AND CONTINUOUS NEIGHBORHOODS
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS 2009年 第2期19卷 173-193页
作者: Elbassioni, Khaled Fishkin, Aleksei V. Sitters, Rene Max Planck Inst Informat D-66123 Saarbrucken Germany Siemens AG Corp Technol Discrete Optimizat D-81739 Munich Germany Vrije Univ Amsterdam Amsterdam Netherlands
In the Euclidean traveling salesman problem with discrete neighborhoods, we are given a set of points P in the plane and a set of n connected regions (neighborhoods), each containing at least one point of P. We seek t... 详细信息
来源: 评论
approximation algorithms and relaxations for a service provision problem on a telecommunication network
收藏 引用
DISCRETE APPLIED MATHEMATICS 2003年 第1期129卷 63-81页
作者: Dye, S Stougie, L Tomasgard, A Norwegian Univ Sci & Technol SINTEF Ind Management N-7034 Trondheim Norway Univ Canterbury Christchurch 1 New Zealand Eindhoven Univ Technol CWI Amsterdam Amsterdam Netherlands
Modem distributed telecommunication networks have widely extended the possibilities of the telecommunication industry for offering a wide variety of services, directly or indirectly by facilitating them for other serv... 详细信息
来源: 评论
approximation algorithms for a k-line center
收藏 引用
ALGORITHMICA 2005年 第3-4期42卷 221-230页
作者: Agarwal, PK Procopiuc, CM Varadarajan, KR Duke Univ Dept Comp Sci Durham NC 27708 USA AT&T Shannon Labs Florham Pk NJ 07932 USA Univ Iowa Dept Comp Sci Iowa City IA 52242 USA
Given a set P of n points in R-d and an integer k >= 1, let w* denote the minimum value so that P can be covered by k congruent cylinders of radius w*. We describe a randomized algorithm that, given P and an epsilo... 详细信息
来源: 评论
approximation algorithms for routing and call scheduling in all-optical chains and rings
收藏 引用
THEORETICAL COMPUTER SCIENCE 2002年 第2期287卷 429-448页
作者: Becchetti, L Di Ianni, M Marchetti-Spaccamela, A Univ Roma La Sapienza Dipartimento Informat & Sistemist I-00198 Rome Italy Univ Perugia Dipartimento Ingn Elettr & Informaz I-06100 Perugia Italy Univ Roma La Sapienza Dipartimento Informat & Sistemist Dipartimento Informat & Sistemist I-00198 Rome Italy
We study the problem of routing and scheduling requests of limited durations in an all-optical network. The task is servicing the requests, assigning each of them a starting time and a wavelength, with restrictions on... 详细信息
来源: 评论
approximation algorithms for connected facility location problems
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2008年 第2期16卷 155-172页
作者: Hasan, Mohammad Khairul Jung, Hyunwoo Chwa, Kyung-Yong Korea Adv Inst Sci & Technol Div Comp Sci Taejon 305701 South Korea
We study Connected Facility Location problems. We are given a connected graph G = (V, E) with nonnegative edge cost c(e) for each edge e epsilon E, a set of clients D subset of V such that each client j epsilon D has ... 详细信息
来源: 评论
approximation algorithms for the watchman route and zookeeper's problems
收藏 引用
DISCRETE APPLIED MATHEMATICS 2004年 第2-3期136卷 363-376页
作者: Tan, XH Tokai Univ Sch High Technol Human Welfare Numazu 4100395 Japan
Given a simple polygon P with n vertices and a starting point s on its boundary, the watchman route problem asks for a shortest route in P through s such that each point in the interior of the polygon can be seen from... 详细信息
来源: 评论
approximation algorithms for average stretch scheduling
收藏 引用
JOURNAL OF SCHEDULING 2004年 第3期7卷 195-222页
作者: Bender, MA Muthukrishnan, S Rajaraman, R SUNY Stony Brook Dept Comp Sci Stony Brook NY 11794 USA Rutgers State Univ Dept Comp Sci Piscataway NJ 08854 USA Northeastern Univ Coll Comp & Informat Sci Boston MA 02115 USA
We study the basic problem of preemptive scheduling of a stream of jobs oil a single processor. Consider all on-line stream of jobs, and let the ith job arrive at time r(i) and have processing time p(i). If C(i) is th... 详细信息
来源: 评论
approximation algorithms for variable voltage processors: Min energy, max throughput and online heuristics
收藏 引用
THEORETICAL COMPUTER SCIENCE 2011年 第32期412卷 4074-4080页
作者: Li, Minming City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China
Dynamic Voltage Scaling techniques allow the processor to set its speed dynamically in order to reduce energy consumption. It was shown that if the processor can run at arbitrary speeds and uses power sa when running ... 详细信息
来源: 评论