咨询与建议

限定检索结果

文献类型

  • 22,830 篇 会议
  • 9,106 篇 期刊文献
  • 62 篇 学位论文
  • 1 册 图书

馆藏范围

  • 31,999 篇 电子文献
  • 1 种 纸本馆藏

日期分布

学科分类号

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

主题

  • 31,999 篇 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,275 篇 英文
  • 575 篇 其他
  • 114 篇 中文
  • 9 篇 日文
  • 7 篇 俄文
  • 4 篇 法文
  • 2 篇 西班牙文
  • 1 篇 德文
  • 1 篇 葡萄牙文
  • 1 篇 土耳其文
检索条件"主题词=approximation algorithms"
31999 条 记 录,以下是591-600 订阅
排序:
New approximation algorithms for the Unsplittable Capacitated Facility Location Problem
收藏 引用
ALGORITHMICA 2016年 第1期75卷 53-83页
作者: Behsaz, Babak Salavatipour, Mohammad R. Svitkina, Zoya Univ Alberta Dept Comp Sci Edmonton AB T6G 2E8 Canada Google Inc 1600 Amphitheatre Pkwy Mountain View CA 94043 USA
In this paper, we consider the Unsplittable (hard) Capacitated Facility Location Problem (UCFLP) with uniform capacities and present new approximation algorithms for it. This problem is a generalization of the classic... 详细信息
来源: 评论
Dynamic programming approximation algorithms for the capacitated lot-sizing problem
收藏 引用
JOURNAL OF GLOBAL OPTIMIZATION 2016年 第2期65卷 231-259页
作者: Buyuktahtakin, I. Esra Liu, Ning Wichita State Univ Ind & Mfg Engn 1845 N Fairmt Wichita KS 67260 USA
This paper provides a new idea for approximating the inventory cost function to be used in a truncated dynamic program for solving the capacitated lot-sizing problem. The proposed method combines dynamic programming w... 详细信息
来源: 评论
Fixed-Parameter and approximation algorithms for Maximum Agreement Forests of Multifurcating Trees
收藏 引用
ALGORITHMICA 2016年 第3期74卷 1019-1054页
作者: Whidden, Chris Beiko, Robert G. Zeh, Norbert Fred Hutchinson Canc Res Ctr Program Computat Biol 1124 Columbia St Seattle WA 98104 USA Dalhousie Univ Fac Comp Sci Halifax NS Canada
We present efficient fixed-parameter and approximation algorithms for the NP-hard problem of computing a maximum agreement forest (MAF) of a pair of multifurcating (nonbinary) rooted trees. Multifurcating trees arise ... 详细信息
来源: 评论
approximation and online algorithms for multidimensional bin packing: A survey
收藏 引用
COMPUTER SCIENCE REVIEW 2017年 24卷 63-79页
作者: Christensen, Henrik I. Khan, Arindam Pokutta, Sebastian Tetali, Prasad Univ Calif San Diego San Diego CA 92103 USA USI SUPSI Ist Dalle Molle Studi Sull Intelligenza Artificia Lugano Switzerland Georgia Inst Technol Atlanta GA 30332 USA
The bin packing problem is a well-studied problem in combinatorial optimization. In the classical bin packing problem, we are given a list of real numbers in (0, 1] and the goal is to place them in a minimum number of... 详细信息
来源: 评论
Improved approximation algorithms for k-connected m-dominating set problems
arXiv
收藏 引用
arXiv 2017年
作者: Nutov, Zeev Open University of Israel
A graph is k-connected if it has k internally-disjoint paths between every pair of nodes. A subset S of nodes in a graph G is a k-connected set if the subgraph G[S] induced by S is k-connected;S is an m-dominating set... 详细信息
来源: 评论
Efficient Online Linear Optimization with approximation algorithms
arXiv
收藏 引用
arXiv 2017年
作者: Garber, Dan Technion - Israel Institute of Technology
We revisit the problem of online linear optimization in case the set of feasible actions is accessible through an approximated linear optimization oracle with a factor α multiplicative approximation guarantee. This s... 详细信息
来源: 评论
On practical accuracy of edit distance approximation algorithms
arXiv
收藏 引用
arXiv 2017年
作者: Hanada, Hiroyuki Kudo, Mineichi Nakamura, Atsuyoshi Graduate School of Information Science and Technology Hokkaido University Kita 14 Nishi 9 Kita-ku Sapporo Hokkaido060-0814 Japan Department of Computer Science Nagoya Institute of Technology. Gokiso-cho Showa-ku Nagoya Aichi Japan
The edit distance is a basic string similarity measure used in many applications such as text mining, signal processing, bioinformatics, and so on. However, the computational cost can be a problem when we repeat many ... 详细信息
来源: 评论
Efficient approximation algorithms for string kernel based sequence classification
arXiv
收藏 引用
arXiv 2017年
作者: Farhan, Muhammad Zaman, Arif Tariq, Juvaria Shabbir, Mudassir Khan, Imdad Ullah Department of Computer Science School of Science and Engineering Lahore University of Management Sciences Lahore Pakistan Department of Mathematics School of Science and Engineering Lahore University of Management Sciences Lahore Pakistan Department of Computer Science Information Technology University Lahore Pakistan
Sequence classification algorithms, such as SVM, require a definition of distance (similarity) measure between two sequences. A commonly used notion of similarity is the number of matches between k-mers (k-length subs... 详细信息
来源: 评论
Distributed approximation algorithms for the multiple knapsack problem
arXiv
收藏 引用
arXiv 2017年
作者: Murthy, Ananth Yeshwanth, Chandan Rao, Shrisha
We consider the distributed version of the Multiple Knapsack Problem (MKP), where m items are to be distributed amongst n processors, each with a knapsack. We propose different distributed approximation algorithms wit... 详细信息
来源: 评论
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
arXiv
收藏 引用
arXiv 2017年
作者: Altschuler, Jason Weed, Jonathan Rigollet, Philippe Massachusetts Institute of Technology
Computing optimal transport distances such as the earth mover's distance is a fundamental problem in machine learning, statistics, and computer vision. Despite the recent introduction of several algorithms with go... 详细信息
来源: 评论