咨询与建议

限定检索结果

文献类型

  • 22,842 篇 会议
  • 9,117 篇 期刊文献
  • 64 篇 学位论文

馆藏范围

  • 32,023 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

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

主题

  • 32,023 篇 approximation al...
  • 2,737 篇 algorithm design...
  • 2,345 篇 optimization
  • 2,306 篇 approximation me...
  • 2,167 篇 heuristic algori...
  • 1,423 篇 linear programmi...
  • 1,411 篇 convergence
  • 1,278 篇 computational mo...
  • 1,216 篇 resource managem...
  • 1,141 篇 signal processin...
  • 956 篇 computer science
  • 914 篇 polynomials
  • 909 篇 complexity theor...
  • 908 篇 clustering algor...
  • 789 篇 mathematical mod...
  • 752 篇 vectors
  • 712 篇 programming
  • 652 篇 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,298 篇 英文
  • 573 篇 其他
  • 113 篇 中文
  • 9 篇 日文
  • 7 篇 俄文
  • 4 篇 法文
  • 2 篇 西班牙文
  • 1 篇 德文
  • 1 篇 葡萄牙文
  • 1 篇 土耳其文
检索条件"主题词=approximation algorithms"
32023 条 记 录,以下是621-630 订阅
排序:
Improved approximation algorithms for k-submodular function maximization  27
Improved approximation algorithms for k-submodular function ...
收藏 引用
27th Annual ACM-SIAM Symposium on Discrete algorithms, SODA 2016
作者: Iwata, Satoru Tanigawa, Shin-Ichi Yoshida, Yuichi Department of Mathematical Informatics University of Tokyo Japan Research Institute for Mathematical Sciences Kyoto University Centrum Wiskunde and Informatica Japan National Institute of Informatics and Preferred Infrastructure Inc. Japan
This paper presents a polynomial-time 1/2-approximation algorithm for maximizing nonnegative k-submodular functions. This improves upon the previous max{l/3,1/(1+ a)}-approximation by Ward and Živný [18], where a... 详细信息
来源: 评论
approximation algorithms for Min-Max Cycle Cover Problems
收藏 引用
IEEE TRANSACTIONS ON COMPUTERS 2015年 第3期64卷 600-613页
作者: Xu, Wenzheng Liang, Weifa Lin, Xiaola Sun Yat Sen Univ Sch Informat Sci & Technol Guangzhou 51006 Guangdong Peoples R China Australian Natl Univ Res Sch Comp Sci Canberra ACT 0200 Australia
As a fundamental optimization problem, the vehicle routing problem has wide application backgrounds and has been paid lots of attentions in past decades. In this paper we study its applications in data gathering and w... 详细信息
来源: 评论
approximation algorithms for Model-Based Compressive Sensing
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 2015年 第9期61卷 5129-5147页
作者: Hegde, Chinmay Indyk, Piotr Schmidt, Ludwig MIT Comp Sci & Artificial Intelligence Lab Cambridge MA 02139 USA
Compressive sensing (CS) states that a sparse signal can be recovered from a small number of linear measurements, and that this recovery can be performed efficiently in polynomial time. The framework of model-based CS... 详细信息
来源: 评论
approximation algorithms for maximum independent set of a unit disk graph
收藏 引用
INFORMATION PROCESSING LETTERS 2015年 第3期115卷 439-446页
作者: Das, Gautam K. De, Minati Kolay, Sudeshna Nandy, Subhas C. Sur-Kolay, Susmita Indian Inst Technol Guwahati Dept Math Gauhati India Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel Inst Math Sci Madras 600113 Tamil Nadu India Indian Stat Inst Kolkata India
We propose a 2-approximation algorithm for the maximum independent set problem for a unit disk graph. The time and space complexities are O(n(3)) and O(n(2)), respectively. For a penny graph, our proposed 2-approximat... 详细信息
来源: 评论
approximation algorithms for Wireless Opportunistic Spectrum Scheduling in Cognitive Radio Networks
Approximation Algorithms for Wireless Opportunistic Spectrum...
收藏 引用
Annual IEEE International Conference on Computer Communications
作者: Xiaohua Xu Min Song Department of Computer Science Michigan Technological University MI
Given a set of communication links in cognitive radio networks, assume that the underlying channel state information along each link is unknown;however, we can estimate it by exploiting the feedbacks and evolutions of... 详细信息
来源: 评论
Integrality gaps and approximation algorithms for dispersers and bipartite expanders  27
Integrality gaps and approximation algorithms for dispersers...
收藏 引用
27th Annual ACM-SIAM Symposium on Discrete algorithms, SODA 2016
作者: Chen, Xue Department of Computer Science University of Texas at Austin United States
We study the problem of approximating the quality of a disperser. A bipartite graph G on ([N], [M]) is a (ρN, (1 -δ)M)-disperser if for any subset S ⊆ [N] of size ρN, the neighbor set Γ (S) contains at least (1-δ... 详细信息
来源: 评论
Additive approximation algorithms for modularity maximization  27
Additive approximation algorithms for modularity maximizatio...
收藏 引用
27th International Symposium on algorithms and Computation, ISAAC 2016
作者: Kawase, Yasushi Matsui, Tomomi Miyauchi, Atsushi Tokyo Institute of Technology Tokyo Japan
The modularity is a quality function in community detection, which was introduced by Newman and Girvan (2004). Community detection in graphs is now often conducted through modularity maximization: given an undirected ... 详细信息
来源: 评论
approximation algorithms for inventory constrained scheduling on a single machine
收藏 引用
JOURNAL OF SCHEDULING 2015年 第6期18卷 645-653页
作者: Morsy, Ehab Pesch, Erwin Univ Siegen Dept Management Informat Sci D-57068 Siegen Germany Suez Canal Univ Dept Math Ismailia 22541 Egypt Univ Siegen Dept Management Informat Sci D-57068 Siegen Germany
We consider the problem of scheduling a set of jobs on a single machine subject to inventory constraints, i.e., conditions that jobs add or remove items to or from a centralized inventory, respectively. Jobs that remo... 详细信息
来源: 评论
Brief announcement: Improved approximation algorithms for scheduling co-flows  16
Brief announcement: Improved approximation algorithms for sc...
收藏 引用
28th ACM Symposium on Parallelism in algorithms and Architectures, SPAA 2016
作者: Khuller, Samir Purohit, Manish Computer Science Department University of Maryland College Park United States
Co-flow scheduling is a recent networking abstraction introduced to capture application-level communication patterns in datacenters. In this paper, we consider the offline co-flow scheduling problem with release times... 详细信息
来源: 评论
approximation algorithms for the joint replenishment problem with deadlines
收藏 引用
JOURNAL OF SCHEDULING 2015年 第6期18卷 545-560页
作者: Bienkowski, Marcin Byrka, Jaroslaw Chrobak, Marek Dobbs, Neil Nowicki, Tomasz Sviridenko, Maxim Swirszcz, Grzegorz Young, Neal E. Univ Wroclaw Inst Comp Sci PL-51151 Wroclaw Poland Univ Calif Riverside Dept Comp Sci Riverside CA 92521 USA IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA Univ Warwick Dept Comp Sci Coventry CV4 7AL W Midlands England
The Joint Replenishment Problem () is a fundamental optimization problem in supply-chain management, concerned with optimizing the flow of goods from a supplier to retailers. Over time, in response to demands at the r... 详细信息
来源: 评论