咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 15,965 篇 工学
    • 10,069 篇 计算机科学与技术...
    • 4,864 篇 电气工程
    • 3,097 篇 软件工程
    • 2,689 篇 信息与通信工程
    • 1,952 篇 控制科学与工程
    • 737 篇 机械工程
    • 681 篇 电子科学与技术(可...
    • 605 篇 航空宇航科学与技...
    • 532 篇 仪器科学与技术
    • 232 篇 交通运输工程
    • 212 篇 材料科学与工程(可...
    • 195 篇 化学工程与技术
    • 171 篇 生物工程
    • 147 篇 测绘科学与技术
    • 134 篇 动力工程及工程热...
    • 134 篇 生物医学工程(可授...
    • 133 篇 土木工程
  • 10,418 篇 理学
    • 9,357 篇 数学
    • 874 篇 物理学
    • 766 篇 系统科学
    • 742 篇 统计学(可授理学、...
    • 265 篇 生物学
    • 235 篇 化学
  • 2,485 篇 管理学
    • 1,929 篇 管理科学与工程(可...
    • 672 篇 工商管理
    • 554 篇 图书情报与档案管...
  • 418 篇 经济学
    • 387 篇 应用经济学
  • 207 篇 医学
    • 171 篇 临床医学
  • 179 篇 法学
    • 166 篇 社会学
  • 128 篇 文学
    • 123 篇 新闻传播学
  • 128 篇 农学
  • 37 篇 教育学
  • 27 篇 军事学
  • 11 篇 艺术学
  • 1 篇 哲学
  • 1 篇 历史学

主题

  • 31,962 篇 approximation al...
  • 2,737 篇 algorithm design...
  • 2,333 篇 optimization
  • 2,306 篇 approximation me...
  • 2,156 篇 heuristic algori...
  • 1,421 篇 linear programmi...
  • 1,403 篇 convergence
  • 1,272 篇 computational mo...
  • 1,216 篇 resource managem...
  • 1,137 篇 signal processin...
  • 955 篇 computer science
  • 910 篇 polynomials
  • 906 篇 clustering algor...
  • 905 篇 complexity theor...
  • 789 篇 mathematical mod...
  • 741 篇 vectors
  • 712 篇 programming
  • 647 篇 estimation
  • 614 篇 transportation
  • 608 篇 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 篇 tel aviv univers...
  • 28 篇 max planck inst ...

作者

  • 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,238 篇 英文
  • 576 篇 其他
  • 114 篇 中文
  • 9 篇 日文
  • 7 篇 俄文
  • 4 篇 法文
  • 2 篇 西班牙文
  • 1 篇 德文
  • 1 篇 葡萄牙文
  • 1 篇 土耳其文
检索条件"主题词=approximation algorithms"
31962 条 记 录,以下是241-250 订阅
排序:
approximation algorithms for Socially Fair Clustering  34
Approximation Algorithms for Socially Fair Clustering
收藏 引用
Conference on Learning Theory (COLT)
作者: Makarychev, Yury Vakilian, Ali Toyota Technol Inst 6045 S Kenwood Ave Chicago IL 60637 USA
We present an (e(O(p)) log l/log log l)-approximation algorithm for socially fair clustering with the l(p)-objective. In this problem, we are given a set of points in a metric space. Each point belongs to one (or seve... 详细信息
来源: 评论
approximation algorithms for the Generalized Multiple Knapsack Problems with k Restricted Elements  7
Approximation Algorithms for the Generalized Multiple Knapsa...
收藏 引用
7th International Conference on Intelligent Human-Machine Systems and Cybernetics (IHMSC)
作者: Huang, Binchao Li, Jianping Lih, Ko-Wei Wang, Haiyan Yunnan Univ Dept Math Kunming Peoples R China Acad Sinica Inst Math Taipei Taiwan Yunnan Univ Finance & Econ Sch Math & Stat Kunming Peoples R China
We are given a set of items, and a set of knapsacks. Both the weight and the profit of an item are functions of the knapsack, and each knapsack has a positive real capacity. A restriction is setting that the number of... 详细信息
来源: 评论
approximation algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles  63
Approximation Algorithms and Hardness for n-Pairs Shortest P...
收藏 引用
63rd Annual IEEE Symposium on Foundations of Computer Science (FOCS)
作者: Dalirrooyfard, Mina Jin, Ce Williams, Virginia Vassilevska Wein, Nicole MIT EECS 77 Massachusetts Ave Cambridge MA 02139 USA MIT CSAIL 77 Massachusetts Ave Cambridge MA 02139 USA Rutgers State Univ DIMACS New Brunswick NJ USA
We study the approximability of two related problems on graphs with n nodes and m edges: n-Pairs Shortest Paths (n-PSP), where the goal is to find a shortest path between O(n) prespecified pairs, and All Node Shortest... 详细信息
来源: 评论
approximation algorithms for Cellular Networks Planning with Relay Nodes
Approximation Algorithms for Cellular Networks Planning with...
收藏 引用
IEEE Wireless Communications and Networking Conference (WCNC)
作者: Wang, Shaowei Zhao, Wentao Wang, Chonggang Nanjing Univ Sch Elect Sci & Engn Nanjing 210093 Jiangsu Peoples R China InterDigital Commun Corp King Of Prussia PA 19406 USA
Relay nodes are introduced to the next generation cellular networks to enhance coverage and improve system capacity, leading to a new radio network planning paradigm. In this paper, we study two planning problems for ... 详细信息
来源: 评论
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 the Team Orienteering Problem  38
Approximation Algorithms for the Team Orienteering Problem
收藏 引用
39th IEEE International Conference on Computer Communications (IEEE INFOCOM)
作者: Xu, Wenzheng Xu, Zichuan Peng, Jian Liang, Weifa Liu, Tang Jia, Xiaohua Das, Sajal K. Sichuan Univ Coll Comp Sci Chengdu 510006 Peoples R China Dalian Univ Technol Sch Software Dalian 116024 Peoples R China Australian Natl Univ Res Sch Comp Sci Canberra ACT 0200 Australia Sichuan Normal Univ Coll Comp Sci Chengdu 610068 Sichuan Peoples R China City Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China Missouri Univ Sci & Technol Dept Comp Sci Rolla MO 65409 USA
In this paper we study a team orienteering problem, which is to find service paths for multiple vehicles in a network such that the profit sum of serving the nodes in the paths is maximized, subject to the cost budget... 详细信息
来源: 评论
approximation algorithms for Online Weighted Rank Function Maximization under Matroid Constraints
Approximation Algorithms for Online Weighted Rank Function M...
收藏 引用
39th International Colloquium on Automata, Languages, and Programming (ICALP)
作者: Buchbinder, Niv Naor, Joseph (Seffi) Ravi, R. Singh, Mohit Open Univ Israel Dept Comp Sci Raanana Israel Dept Comp Sci Techn Haifa Israel Carnegie Mellon Univ Tepper Sch Business Pittsburgh PA USA McGill Univ Redmond & Sch Comp Sci Microsoft Res Montreal PQ H3A 2T5 Canada
Consider the following online version of the submodular maximization problem under a matroid constraint. We are given a set of elements over which a matroid is defined. The goal is to incrementally choose a subset tha... 详细信息
来源: 评论
approximation algorithms for survivable multicommodity flow problems with applications to network design
Approximation algorithms for survivable multicommodity flow ...
收藏 引用
IEEE INFOCOM 2006 Conference/25th IEEE International Conference on Computer Communications
作者: Todimala, Ajay Ramamurthy, Byrav Univ Nebraska Dept Comp Sci & Engn Lincoln NE 68588 USA
Multicommodity flow (MF) problems have a wide variety of applications in areas such as VLSI circuit design, network design, etc., and are therefore very well studied. The fractional MF problems are polynomial time sol... 详细信息
来源: 评论
approximation algorithms for the watchman route and zookeeper's problems
Approximation algorithms for the watchman route and zookeepe...
收藏 引用
1st CologneTwente Workshop on Graphs and Combinatorial Optimization (CTW2001)
作者: 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 Restless Bandit Problems
Approximation Algorithms for Restless Bandit Problems
收藏 引用
20th Annual ACM-SIAM Symposium on Discrete algorithms
作者: Guha, Sudipto Munagala, Kamesh Shi, Peng Univ Penn Dept Comp & Informat Sci Philadelphia PA 19104 USA Duke Univ Dept Comp Sci Durham NC 27708 USA Duke Univ Durham NC 27708 USA
In this paper, we consider the restless bandit problem, which is one of the most well-studied generalizations of the celebrated stochastic multi-armed bandit problem in decision theory. In its ultimate generality, the... 详细信息
来源: 评论