咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 15,921 篇 工学
    • 10,032 篇 计算机科学与技术...
    • 4,845 篇 电气工程
    • 3,065 篇 软件工程
    • 2,672 篇 信息与通信工程
    • 1,947 篇 控制科学与工程
    • 738 篇 机械工程
    • 679 篇 电子科学与技术(可...
    • 605 篇 航空宇航科学与技...
    • 532 篇 仪器科学与技术
    • 230 篇 交通运输工程
    • 215 篇 材料科学与工程(可...
    • 195 篇 化学工程与技术
    • 171 篇 生物工程
    • 144 篇 测绘科学与技术
    • 134 篇 动力工程及工程热...
    • 134 篇 生物医学工程(可授...
    • 130 篇 土木工程
  • 10,399 篇 理学
    • 9,342 篇 数学
    • 869 篇 物理学
    • 766 篇 系统科学
    • 737 篇 统计学(可授理学、...
    • 264 篇 生物学
    • 236 篇 化学
  • 2,477 篇 管理学
    • 1,925 篇 管理科学与工程(可...
    • 671 篇 工商管理
    • 547 篇 图书情报与档案管...
  • 417 篇 经济学
    • 386 篇 应用经济学
  • 206 篇 医学
    • 171 篇 临床医学
  • 179 篇 法学
    • 166 篇 社会学
  • 128 篇 文学
    • 123 篇 新闻传播学
  • 128 篇 农学
  • 37 篇 教育学
  • 27 篇 军事学
  • 11 篇 艺术学
  • 1 篇 哲学
  • 1 篇 历史学

主题

  • 31,878 篇 approximation al...
  • 2,736 篇 algorithm design...
  • 2,322 篇 optimization
  • 2,304 篇 approximation me...
  • 2,148 篇 heuristic algori...
  • 1,422 篇 linear programmi...
  • 1,400 篇 convergence
  • 1,268 篇 computational mo...
  • 1,213 篇 resource managem...
  • 1,132 篇 signal processin...
  • 956 篇 computer science
  • 910 篇 polynomials
  • 904 篇 clustering algor...
  • 902 篇 complexity theor...
  • 791 篇 mathematical mod...
  • 731 篇 vectors
  • 712 篇 programming
  • 646 篇 estimation
  • 611 篇 transportation
  • 607 篇 training

机构

  • 97 篇 univ maryland de...
  • 70 篇 technion israel ...
  • 55 篇 univ waterloo de...
  • 49 篇 cornell univ dep...
  • 42 篇 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 篇 tel aviv univers...
  • 28 篇 max planck inst ...
  • 27 篇 epfl

作者

  • 64 篇 woodruff david p...
  • 64 篇 ravi r.
  • 52 篇 kortsarz guy
  • 43 篇 lee euiwoong
  • 43 篇 levin asaf
  • 41 篇 chan timothy m.
  • 41 篇 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,193 篇 英文
  • 548 篇 其他
  • 114 篇 中文
  • 9 篇 日文
  • 7 篇 俄文
  • 5 篇 法文
  • 3 篇 德文
  • 2 篇 西班牙文
  • 1 篇 葡萄牙文
  • 1 篇 土耳其文
检索条件"主题词=approximation algorithms"
31878 条 记 录,以下是281-290 订阅
排序:
approximation algorithms for Cutting a Convex Polyhedron Out of a Sphere
Approximation Algorithms for Cutting a Convex Polyhedron Out...
收藏 引用
Joint 5th International Frontiers in Algorithmics Workshop (FAW) / 7th International Conference on Algorithmic Aspects in Information and Management (AAIM)
作者: Tan, Xuehou Wu, Gangshan Tokai Univ 4-1-1 Kitakaname Hiratsuka Kanagawa 2591292 Japan Nanjing Univ State Key Lab Novel Software Technol Nanjing 210093 Jiangsu Peoples R China
This paper presents the following approximation algorithms for computing a minimum cost sequence of planes to cut a convex polyhedron P of n vertices out of a sphere Q: an O(n log n) time O(log(2) n)-factor approximat... 详细信息
来源: 评论
approximation algorithms for Bipartite Matching with Metric and Geometric Costs  14
Approximation Algorithms for Bipartite Matching with Metric ...
收藏 引用
46th Annual ACM Symposium on Theory of Computing (STOC)
作者: Agarwal, Pankaj K. Sharathkumar, R. Duke Univ Durham NC 27706 USA Stanford Univ Stanford CA 94305 USA
Let G = G(AUB,A x B), with vertical bar A vertical bar =vertical bar B vertical bar = n, be a weighted bipartite graph, and let d(.,.) be the cost function on the edges. Let w(M) denote the weight of a matching in G, ... 详细信息
来源: 评论
approximation algorithms for Large Scale Data Analysis  21
Approximation Algorithms for Large Scale Data Analysis
收藏 引用
40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS)
作者: Saha, Barna Univ Calif Berkeley Berkeley CA 94720 USA
One of the greatest successes of computational complexity theory is the classification of countless fundamental computational problems into polynomial-time and NP-hard ones, two classes that are often referred to as t... 详细信息
来源: 评论
approximation algorithms for Euler genus and related problems
Approximation algorithms for Euler genus and related problem...
收藏 引用
IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS)
作者: Chekuri, Chandra Sidiropoulos, Anastasios Univ Illinois Dept Comp Sci 1304 W Springfield Ave Urbana IL 61801 USA Ohio State Univ Dept Comp Sci & Engn Columbus OH 43210 USA
The Euler genus of a graph is a fundamental and well-studied parameter in graph theory and topology. Computing it has been shown to be NP-hard by Thomassen [23], [24], and it is known to be fixed-parameter tractable. ... 详细信息
来源: 评论
approximation algorithms for the Max-Buying Problem with Limited Supply
Approximation Algorithms for the Max-Buying Problem with Lim...
收藏 引用
11th Latin American Theoretical INformatics Symposium (LATIN)
作者: Fernandes, Cristina G. Schouery, Rafael C. S. Univ Sao Paulo Dept Comp Sci BR-05508 Sao Paulo Brazil
We consider the Max-Buying Problem with Limited Supply, in which there are n items, with C-i copies of each item i, and m bidders such that every bidder b has valuation v(ib) for item i. The goal is to find a pricing ... 详细信息
来源: 评论
approximation algorithms for Preference Aggregation Using CP-Nets  38
Approximation Algorithms for Preference Aggregation Using CP...
收藏 引用
38th AAAI Conference on Artificial Intelligence (AAAI) / 36th Conference on Innovative Applications of Artificial Intelligence / 14th Symposium on Educational Advances in Artificial Intelligence
作者: Ali, Abu Mohammad Hammad Yang, Boting Zilles, Sandra Univ Regina Regina SK Canada
This paper studies the design and analysis of approximation algorithms for aggregating preferences over combinatorial domains, represented using Conditional Preference Networks (CP-nets). Its focus is on aggregating p... 详细信息
来源: 评论
approximation algorithms for Intersection Graphs
Approximation Algorithms for Intersection Graphs
收藏 引用
13th International Workshop on approximation algorithms for Combinatorial Optimization Problems (APPROX 2010)/14th International Workshop on Randomization and Computation (RANDOM 2010)
作者: Kammer, Frank Tholey, Torsten Voepel, Heiko Univ Augsburg Inst Informat D-86135 Augsburg Germany
We study three complexity parameters that in some sense measure how chordal-like a graph is. The similarity to chordal graphs is used to construct simple polynomial-time approximation algorithms with constant approxim... 详细信息
来源: 评论
approximation algorithms and complexity results for path problems in trees of rings  26th
收藏 引用
26th International Symposium on Mathematical Foundations of Computer Science
作者: Erlebach, T Swiss Fed Inst Technol Comp Engn & Networks Lab CH-8092 Zurich Switzerland
A tree of rings is a network that is obtained by interconnecting rings in a tree structure such that any two rings share at most one node. A connection request (call) in a tree of rings is given by its two endpoints a... 详细信息
来源: 评论
approximation algorithms for maximum linear arrangement  7th
收藏 引用
7th Scandinavian Workshop on Algorithm Theory (SWAT 2000)
作者: Hassin, R Rubinstein, S Tel Aviv Univ Sch Math Sci Dept Stat & Operat Res IL-69978 Tel Aviv Israel
The GENERALIZED MAXIMUM LINEAR ARRANGEMENT PROBLEM is to compute for a given vector x is an element of IRn and an n x n non-negative symmetric matrix w = (w(i,j)), a permutation pi of {1,...,n} that maximizes Sigma (i... 详细信息
来源: 评论
approximation algorithms for Robot Tours in Random Fields with Guaranteed Estimation Accuracy
Approximation Algorithms for Robot Tours in Random Fields wi...
收藏 引用
IEEE International Conference on Robotics and Automation (ICRA)
作者: Dulta, Shamak Wilde, Nils Tokekar, Pratap Smith, Stephen L. Univ Waterloo Dept Elect & Comp Engn Waterloo ON Canada Delft Univ Technol Cognit Robot Dept Delft Netherlands Univ Maryland Dept Comp Sci College Pk MD USA
We study the sample placement and shortest tour problem for robots tasked with mapping environmental phenomena modeled as stationary random fields. The objective is to minimize the resources used (samples or tour leng... 详细信息
来源: 评论