咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是451-460 订阅
排序:
approximation algorithms for controller placement problems in software defined networks  3
Approximation algorithms for controller placement problems i...
收藏 引用
3rd IEEE International Conference on Data Science in Cyberspace, DSC 2018
作者: Li, Tianshu Gu, Zhaoquan Lin, Xiao Li, Shudong Tan, Qingfeng Guangzhou University Divine Tech. Ltd. Co. Guangzhou China Tsinghua University Beijing China
Software Defined Networks (SDNs) have been a new paradigm to separate the network control plane from the data forwarding plane. Controller placement is one fundamental problem which identifies the number of controller... 详细信息
来源: 评论
approximation algorithms for stochastic clustering  32
Approximation algorithms for stochastic clustering
收藏 引用
32nd Conference on Neural Information Processing Systems, NeurIPS 2018
作者: Harris, David G. Li, Shi Pensyl, Thomas Srinivasan, Aravind Trinh, Khoa Department of Computer Science University of Maryland College ParkMD20742 United States University at Buffalo BuffaloNY United States Bandwidth Inc RaleighNC United States Department of Computer Science Institute for Advanced Computer Studies University of Maryland College ParkMD20742 United States Google Mountain ViewCA94043 United States
We consider stochastic settings for clustering, and develop provably-good (approximation) algorithms for a number of these notions. These algorithms allow one to obtain better approximation ratios compared to the usua... 详细信息
来源: 评论
approximation algorithms for stochastic k-TSP  37
Approximation algorithms for stochastic k-TSP
收藏 引用
37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017
作者: Ene, Alina Nagarajan, Viswanath Saket, Rishi Computer Science Department Boston University Boston United States Industrial and Operations Engineering Department University of Michigan Ann Arbor United States IBM Research India Bangalore India
This paper studies the stochastic variant of the classical k-TSP problem where rewards at the vertices are independent random variables which are instantiated upon the tour’s visit. The objective is to minimize the e... 详细信息
来源: 评论
approximation algorithms and a hardness result for the three-machine proportionate mixed shop  12th
Approximation algorithms and a hardness result for the three...
收藏 引用
12th International Conference on Algorithmic Aspects in Information and Management, AAIM 2018
作者: Liu, Longcheng Ni, Guanqun Chen, Yong Goebel, Randy Luo, Yue Zhang, An Lin, Guohui School of Mathematical Sciences Xiamen University Xiamen China College of Management Fujian Agriculture and Forestry University Fuzhou China Department of Mathematics Hangzhou Dianzi University Hangzhou China Department of Computing Science University of Alberta EdmontonAB Canada
A mixed shop is to process a mixture of a set of flow-shop jobs and a set of open-shop jobs. Mixed shops are in general much harder than flow-shops and open-shops, and have been studied since the 1980’s. We consider ... 详细信息
来源: 评论
IMPROVED approximation algorithms FOR (BUDGETED) NODE-WEIGHTED STEINER PROBLEMS
收藏 引用
SIAM JOURNAL ON COMPUTING 2018年 第4期47卷 1275-1293页
作者: Bateni, Mohammad Hossein Hajiaghayi, Mohammad Taghi Liaghat, Vahid Google Res New York NY 10011 USA Univ Maryland Comp Sci Dept College Pk MD 20742 USA Facebook Menlo Pk CA 94025 USA
Moss and Rabani study constrained node-weighted Steiner tree problems with two independent weight values associated with each node, namely, cost and prize (or penalty). They give an O(log n)-approximation algorithm fo... 详细信息
来源: 评论
Trajectory planning for robotic maintenance of pasture based on approximation algorithms
收藏 引用
BIOSYSTEMS ENGINEERING 2018年 174卷 219-230页
作者: Cariou, Christophe Gobor, Zoltan Irstea UR TSCF 9 Ave Blaise Pascal CS 20085 F-63178 Aubiere France Inst Agr Engn & Anim Husb LfL Bavarian State Res Ctr Agr Vottinger Str 36 D-85354 Freising Weihenstephan Germany
This paper addresses the problem of trajectory planning of a mobile robot for pasture maintenance comprising mulching weeds, reseeding patches without vegetation and spreading cowpats. Based on the sensor-based acquir... 详细信息
来源: 评论
On approximation algorithms for concave mixed-integer quadratic programming
收藏 引用
MATHEMATICAL PROGRAMMING 2018年 第1-2期172卷 3-16页
作者: Del Pia, Alberto Univ Wisconsin Wisconsin Inst Discovery Dept Ind & Syst Engn Madison WI 53706 USA
Concave mixed- integer quadratic programming is the problem of minimizing a concave quadratic polynomial over the mixed- integer points in a polyhedral region. In this work we describe an algorithm that finds an - app... 详细信息
来源: 评论
Improved approximation algorithms for weighted 2-path partitions
收藏 引用
DISCRETE APPLIED MATHEMATICS 2018年 239卷 15-37页
作者: Bar-Noy, Amotz Peleg, David Rabanca, George Vigan, Ivo CUNY Grad Ctr Dept Comp Sci New York NY 10021 USA Weizmann Inst Sci Dept Comp Sci & Appl Math Rehovot Israel
We investigate two NP-complete vertex partition problems on edge-weighted complete graphs with 3k vertices. The first problem asks to partition the graph into k vertex disjoint paths of length 2 (referred to as 2-path... 详细信息
来源: 评论
Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs
收藏 引用
DISCRETE OPTIMIZATION 2018年 27卷 26-56页
作者: Bonnet, Edouard Escoffier, Bruno Paschos, Vangelis Th. Stamoulis, Georgios Middlesex Univ Dept Comp Sci London England UPMC Univ Paris 6 CNRS Sorbonne Univ LIP6UMR 7606 Paris France PSL Res Univ Univ Paris Dauphine CNRS UMR 7243LAMSADE F-75016 Paris France Maastricht Univ Dept Data Sci & Knowledge Engn Maastricht Netherlands
We study the polynomial time approximation of the NP-hard MAX k-VERTEX COVER problem in bipartite graphs and propose purely combinatorial approximation algorithms . The main result of the paper is a simple combinatori... 详细信息
来源: 评论
Dual-Based approximation algorithms for Cut-Based Network Connectivity Problems
收藏 引用
ALGORITHMICA 2018年 第10期80卷 2849-2873页
作者: Grimmer, Benjamin Cornell Univ Ithaca NY 14850 USA
We consider a variety of NP-Complete network connectivity problems. We introduce a novel dual-based approach to approximating network design problems with cut-based linear programming relaxations. This approach gives ... 详细信息
来源: 评论