咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是571-580 订阅
排序:
approximation algorithms for stochastic and risk-averse optimization
arXiv
收藏 引用
arXiv 2017年
作者: Byrka, Jaroslaw Srinivasan, Aravind Institute of Computer Science University of Wroclaw Joliot-Curie 15 Wroclaw50-383 Poland Department of Computer Science Institute for Advanced Computer Studies University of Maryland College ParkMD20742 United States
We present improved approximation algorithms in stochastic optimization. We prove that the multi-stage stochastic versions of covering integer programs (such as set cover and vertex cover) admit essentially the same a... 详细信息
来源: 评论
approximation algorithms for maximin fair division
arXiv
收藏 引用
arXiv 2017年
作者: Barman, Siddharth Krishnamurthy, Sanath Kumar Indian Institute of Science India Chennai Mathematical Institute India
We consider the problem of dividing indivisible goods fairly among n agents who have additive and submodular valuations for the goods. Our fairness guarantees are in terms of the maximin share, that is defined to be t... 详细信息
来源: 评论
approximation algorithms for replenishment problems with fixed turnover times
arXiv
收藏 引用
arXiv 2017年
作者: Bosman, Thomas Van Ee, Martijn Jiao, Yang Marchetti-Spaccamela, Alberto Ravi, R. Stougie, Leen Vrije Universiteit Amsterdam Netherlands Tepper School of Business Carnegie Mellon University PittsburghPA United States Sapienza University of Rome Rome Italy Amsterdam Netherlands
We introduce and study a class of optimization problems we coin replenishment problems with fixed turnover times: a very natural model that has received little attention in the literature. Nodes with capacity for stor... 详细信息
来源: 评论
approximation Scheduling algorithms for Electric Vehicle Charging with Discrete Charging Options  18
Approximation Scheduling Algorithms for Electric Vehicle Cha...
收藏 引用
9th ACM International Conference on Future Energy Systems (ACM e-Energy)
作者: Khonji, Majid Chau, Sid Chi-Kin Elbassioni, Khaled Khalifa Univ Masdar Inst Abu Dhabi U Arab Emirates
To cope with the high-level penetration of electric vehicles (EVs), an intelligent scheduling mechanism for EV charging is required for maintaining the electricity grid within the operating limits, mitigating the dema... 详细信息
来源: 评论
On some euclidean clustering problems: Np-hardness and efficient approximation algorithms
On some euclidean clustering problems: Np-hardness and effic...
收藏 引用
8th International Conference on Optimization and Applications, OPTIMA 2017
作者: Kel'manov, Alexander Sobolev Institute of Mathematics Acad. Koptyug avenue 4 Novosibirsk630090 Russia Novosibirsk State University Pirogova str. 1 Novosibirsk630090 Russia
We consider some poorly studied clustering problems. The paper purpose is to present a short survey on some new results on the computational complexity of these problems, and on efficient algorithms with performance g... 详细信息
来源: 评论
approximation algorithms for Route Planning with Nonlinear Objectives  30
Approximation Algorithms for Route Planning with Nonlinear O...
收藏 引用
30th Association-for-the-Advancement-of-Artificial-Intelligence (AAAI) Conference on Artificial Intelligence
作者: Yang, Ger Nikolova, Evdokia Univ Texas Austin Elect & Comp Engn Austin TX 78712 USA
We consider optimal route planning when the objective function is a general nonlinear and non-monotonic function. Such an objective models user behavior more accurately, for example, when a user is risk-averse, or the... 详细信息
来源: 评论
approximation algorithms for Cumulative VRP with Stochastic Demands  2nd
Approximation Algorithms for Cumulative VRP with Stochastic ...
收藏 引用
2nd Conference on algorithms and Discrete Applied Mathematics (CALDAM)
作者: Gaur, Daya Ram Mudgal, Apurva Singh, Rishi Ranjan Univ Lethbridge Dept Math & Comp Sci 4401 Univ Dr Lethbridge AB T1K 3M4 Canada Indian Inst Technol Ropar Dept Comp Sci & Engn Nangal Rd Rupnagar 140001 Punjab India Indian Inst Informat Technol Allahabad Dept Informat Technol Allahabad 211012 Uttar Pradesh India
In this paper we give randomized approximation algorithms for stochastic cumulative VRPs for split and unsplit deliveries. The approximation ratios are 2(1 + alpha) and 7 respectively, where a is the approximation rat... 详细信息
来源: 评论
approximation algorithms for geometric dispersion
Approximation algorithms for geometric dispersion
收藏 引用
作者: Alfonso Bolivar CEVALLOS MANZANO ECOLE POLYTECHNIQUE FEDERALE DE LAUSANNE
学位级别:博士
The most basic form of the max-sum dispersion problem ( MSD ) is as follows: given n points in R q and an integer k, select a set of k points such that the sum of the pairwise distances within the set is maximal. This... 详细信息
来源: 评论
approximation algorithms for node-weighted prize-collecting steiner tree problems on planar graphs  15
Approximation algorithms for node-weighted prize-collecting ...
收藏 引用
15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016
作者: Byrka, Jaroslaw Lewandowski, Mateusz Moldenhauer, Carsten University of Wroclaw Wroclaw Poland EPFL Lausanne Switzerland
We study the prize-collecting version of the node-weighted Steiner tree problem (NWPCST) restricted to planar graphs. We give a new primal-dual Lagrangian-multiplier-preserving (LMP) 3-approximation algorithm for plan... 详细信息
来源: 评论
approximation algorithms for parallel machine scheduling with speed-up resources  19
Approximation algorithms for parallel machine scheduling wit...
收藏 引用
19th International Workshop on approximation algorithms for Combinatorial Optimization Problems, APPROX 2016 and the 20th International Workshop on Randomization and Computation, RANDOM 2016
作者: Chen, Lin Ye, Deshi Zhang, Guochuan Budapest Hungary Zhejiang University College of Computer Science Hangzhou China
We consider the problem of scheduling with renewable speed-up resources. Given m identical machines, n jobs and c different discrete resources, the task is to schedule each job non-preemptively onto one of the machine... 详细信息
来源: 评论