咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是681-690 订阅
排序:
Improved approximation algorithms for embedding hyperedges in a cycle
收藏 引用
INFORMATION PROCESSING LETTERS 1998年 第5期67卷 267-271页
作者: Gonzalez, TE Univ Calif Santa Barbara Dept Comp Sci Santa Barbara CA 93106 USA
approximation algorithms for embedding hyperedges in a cycle so as to minimize the maximum congestion are presented. Our algorithms generate an embedding by transforming the problem into another problem solvable in po... 详细信息
来源: 评论
Improved approximation algorithms for low-density instances of the Minimum Entropy Set Cover Problem
收藏 引用
INFORMATION PROCESSING LETTERS 2014年 第7期114卷 360-364页
作者: Bonchis, Cosmin Istrate, Gabriel West Univ Timisoara Dept Comp Sci RO-300223 Timisoara Romania E Austria Res Inst RO-300223 Timisoara Romania
We study the approximability of instances of the minimum entropy set cover problem, parameterized by the average frequency of a random element in the covering sets. We analyze an algorithm combining a greedy approach ... 详细信息
来源: 评论
On approximation algorithms for the terminal Steiner tree problem
收藏 引用
INFORMATION PROCESSING LETTERS 2004年 第1期89卷 15-18页
作者: Drake, DE Hougardy, S Humboldt Univ Inst Informat D-10099 Berlin Germany
The terminal Steiner tree problem is a special version of the Steiner tree problem, where a Steiner minimum tree has to be found in which all terminals are leaves. We prove that no polynomial time approximation algori... 详细信息
来源: 评论
Constant factor approximation algorithms for the densest k-subgraph problem on proper interval graphs and bipartite permutation graphs
收藏 引用
INFORMATION PROCESSING LETTERS 2010年 第16期110卷 635-638页
作者: Backer, Jonathan Keil, J. Mark Univ Saskatchewan Dept Comp Sci Saskatoon SK S7N 5C9 Canada
The densest k-subgraph problem asks for a k-vertex subgraph with the maximum number of edges. This problem is NP-hard on bipartite graphs, chordal graphs, and planar graphs. A 3-approximation algorithm is known for ch... 详细信息
来源: 评论
Improved approximation algorithms for minimum AND-circuits problem via k-set cover
收藏 引用
INFORMATION PROCESSING LETTERS 2011年 第5期111卷 218-221页
作者: Morizumi, Hiroki Kyoto Univ Grad Sch Informat Sakyo Ku Kyoto 6068501 Japan
Arpe and Manthey [J. Arpe, B. Manthey, Approximability of minimum AND-circuits, Algorithmica 53 (3) (2009) 337-357] recently studied the minimum AND-circuit problem, which is a circuit minimization problem, and showed... 详细信息
来源: 评论
LEARNING APPLIED TO SUCCESSIVE approximation algorithms
收藏 引用
IEEE TRANSACTIONS ON SYSTEMS SCIENCE AND CYBERNETICS 1970年 第2期SSC6卷 97-&页
作者: SARIDIS, GN School of Electrical Engineering Purdue University Lafayette IN USA
A linear reinforcement learning technique is proposed to provide a memory and thus accelerate the convergence of successive approximation algorithms. The learning scheme is used to update weighting coefficients applie... 详细信息
来源: 评论
Efficient approximation algorithms for Scheduling Coflows with Total Weighted Completion Time in Identical Parallel Networks
收藏 引用
IEEE Transactions on Cloud Computing 2024年 第1期12卷 116-129页
作者: Chen, Chi-Yeh National Cheng Kung University Department of Computer Science and Information Engineering Tainan701 Taiwan
This article addresses the scheduling problem of coflows in identical parallel networks, a well-known NPNP-hard problem. We consider both flow-level scheduling and coflow-level scheduling problems. In the flow-level s... 详细信息
来源: 评论
Constant approximation algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs
收藏 引用
DISCRETE & COMPUTATIONAL GEOMETRY 2012年 第1期47卷 187-214页
作者: Chepoi, V. Dragan, F. F. Newman, I. Rabinovich, Y. Vaxes, Y. Univ Aix Marseille Fac Sci Lab Informat Fdn F-13288 Marseille 9 France Kent State Univ Dept Comp Sci Kent OH 44242 USA Univ Haifa Dept Comp Sci IL-31905 Haifa Israel
In this paper, we present a simple factor 6 algorithm for approximating the optimal multiplicative distortion of embedding a graph metric into a tree metric (thus improving and simplifying the factor 100 and 27 algori... 详细信息
来源: 评论
Efficiency of Wireless Networks: approximation algorithms for the Physical Interference Model
收藏 引用
FOUNDATIONS AND TRENDS IN NETWORKING 2009年 第3期4卷 313-420页
作者: Goussevskaia, Olga Pignolet, Yvonne-Anne Wattenhofer, Roger Swiss Fed Inst Technol Zurich Switzerland IBM Res Zurich Lab Zurich Switzerland
In this monograph we survey results from a newly emerging line of research that targets algorithm analysis in the physical interference model. In the main part of our monograph we focus on wireless scheduling: given a... 详细信息
来源: 评论
Efficient approximation algorithms for two-label point labeling
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS 2001年 第4期11卷 455-464页
作者: Zhu, BH Poon, CK City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China
In this paper we propose and study two practical variations of the map labeling problem: Given a set S of n distinct (point) sites in the plane, label each site with: (1) a pair of non-intersecting squares of maximum ... 详细信息
来源: 评论