咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是251-260 订阅
排序:
approximation algorithms for Domination Search
Approximation Algorithms for Domination Search
收藏 引用
8th Workshop on approximation and Online algorithms
作者: Fomin, Fedor V. Golovach, Petr A. Thilikos, Dimitrios M. Univ Bergen Dept Informat N-5020 Bergen Norway Univ Durham Sch Engn & Comp Sci Durham DH1 3LE England Univ Athens Dept Math GR-15784 Athens Greece
The r-domination search game on graphs is a game-theoretical approach to the investigation of several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify the minimum number... 详细信息
来源: 评论
approximation algorithms for Robust Clustering Problems Using Local Search Techniques  1
收藏 引用
18th Annual Conference on Theory and Applications of Models of Computation (TAMC)
作者: Wu, Chenchen Moehring, Rolf H. Wang, Yishui Xu, Dachuan Zhang, Dongmei Tianjin Univ Technol Coll Sci Inst Operat Res & Syst Engn Tianjin 300384 Peoples R China Hefei Univ Inst Appl Optimizat Dept Comp Sci & Technol Hefei Peoples R China Tech Univ Berlin Inst Math Combinatorial Optimizat & Graph Algorithms COGA G Berlin Germany Univ Sci & Technol Beijing Sch Math & Phys Beijing Peoples R China Beijing Univ Technol Dept Operat Res & Informat Engn Beijing 100124 Peoples R China Shandong Jianzhu Univ Sch Comp Sci & Technol Jinan 250101 Peoples R China
In this paper, we explore two robust models for the k-median and k-means problems: the outlier-version (k-MedO/k-MeaO) and the penalty-version (k-MedP/k-MeaP), enabling the marking and elimination of certain points as... 详细信息
来源: 评论
approximation algorithms for Matroidal and Cardinal Generalizations of Stable Matching
Approximation Algorithms for Matroidal and Cardinal Generali...
收藏 引用
Symposium on Simplicity in algorithms (SOSA)
作者: Csaji, Gergely Kiraly, Tamas Yokoi, Yu Eotvos Lorand Univ Dept Operat Res MTA ELTE Momentum Matroid Optimizat Res Grp Budapest Hungary Eotvos Lorand Univ Dept Operat Res MTA ELTE Egervary Res Grp Budapest Hungary Natl Inst Informat Principles Informat Res Div Tokyo Japan
The Stable Marriage problem (SM), solved by the famous deferred acceptance algorithm of Gale and Shapley (GS), has many natural generalizations. If we allow ties in preferences, then the problem of finding a maximum s... 详细信息
来源: 评论
approximation algorithms for Wireless Link Scheduling with Flexible Data Rates
Approximation Algorithms for Wireless Link Scheduling with F...
收藏 引用
20th Annual European Symposium on algorithms (ESA)
作者: Kesselheim, Thomas Rhein Westfal TH Aachen Dept Comp Sci Aachen Germany
We consider scheduling problems in wireless networks with respect to flexible data rates. That is, more or less data can be transmitted per time depending on the signal quality, which is determined by the signal-to-in... 详细信息
来源: 评论
approximation algorithms for Labeling Hierarchical Taxonomies
Approximation Algorithms for Labeling Hierarchical Taxonomie...
收藏 引用
19th ACM-SIAM Symposium on Discrete algorithms
作者: Rabani, Yuval Schulman, Leonard J. Swamy, Chaitanya Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel CALTECH Pasadena CA 91125 USA Univ Waterloo Dept Combinator & Optimizat Waterloo ON 2L 3G1 Canada
We consider the following taxonomy labeling problem. Each node of an n-node tree has to be labeled with the values of kappa attributes. A partial labeling is given as part of the input. The goal is to complete this la... 详细信息
来源: 评论
approximation algorithms for Variable Voltage Processors: Min Energy, Max Throughput and Online Heuristics
Approximation Algorithms for Variable Voltage Processors: Mi...
收藏 引用
20th International Symposium on algorithms and Computations (ISAAC 2009)
作者: Li, Minming City Univ Hong Kong Dept Comp Sci Hong Kong 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 s(alpha) when ru... 详细信息
来源: 评论
approximation algorithms for Multi-Criteria Traveling Salesman Problems
Approximation Algorithms for Multi-Criteria Traveling Salesm...
收藏 引用
4th International Workshop on approximation and Online algorithms
作者: Manthey, Bodo Ram, L. Shankar Yale Univ Dept Comp Sci New Haven CT 06520 USA ETH Inst Theoret Informat CH-8092 Zurich Switzerland
We analyze approximation algorithms for several variants of the traveling salesman problem with multiple objective functions. First, we consider the symmetric TSP (STSP) with gamma-triangle inequality. For this proble... 详细信息
来源: 评论
approximation algorithms for a Two-Phase Knapsack Problem  1
收藏 引用
24th International Computing and Combinatorics Conference (COCOON)
作者: Nip, Kameng Wang, Zhenbo Sun Yat Sen Univ Sch Math Zhuhai Zhuhai Peoples R China Tsinghua Univ Dept Math Sci Beijing Peoples R China
We consider a natural generalization of the knapsack problem and the multiple knapsack problem, which has two phases of packing decisions. In this problem, we have a set of items, several small knapsacks called boxes,... 详细信息
来源: 评论
approximation algorithms and Hardness Results for the Joint Replenishment Problem with Constant Demands
Approximation Algorithms and Hardness Results for the Joint ...
收藏 引用
19th Annual European Symposium on algorithms (ESA)
作者: Schulz, Andreas S. Telha, Claudio MIT Sloan Sch Mgmt Cambridge MA 02139 USA MIT Ctr Operat Res Cambridge MA USA
In the Joint Replenishment Problem (JRP), the goal is to coordinate the replenishments of a collection of goods over time so that continuous demands are satisfied with minimum overall ordering and holding costs. We co... 详细信息
来源: 评论
approximation algorithms for Min-Sum k-Clustering and Balanced k-Median  1
收藏 引用
42nd International Colloquium on Automata, Languages and Programming (ICALP)
作者: Behsaz, Babak Friggstad, Zachary Salavatipour, Mohammad R. Sivakumar, Rohit Univ Alberta Dept Comp Sci Edmonton AB Canada
We consider two closely related fundamental clustering problems in this paper. In the Min-Sum k-Clustering problem, one is given a metric space and has to partition the points into k clusters while minimizing the tota... 详细信息
来源: 评论