咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是391-400 订阅
排序:
approximation algorithms for facility location problems  3
收藏 引用
3rd International Workshop on approximation algorithms for Combinatorial Optimization, APPROX 2000
作者: Shmoys, David B. Cornell University IthacaNY14853 United States
One of the most flourishing areas of research in the design and analysis of approximation algorithms has been for facility location problems. In particular, for the metric case of two simple models, the uncapacitated ... 详细信息
来源: 评论
approximation algorithms for quickest spanning tree problems
收藏 引用
12th Annual European Symposium on algorithms (ESA 2004)
作者: Hassin, R Levin, A Tel Aviv Univ Dept Stat & Operat Res IL-69978 Tel Aviv Israel Technion Israel Inst Technol Fac Ind Engn & Management IL-32000 Haifa Israel
Let G = (V, E) be an undirected multi-graph with a special vertex root E V, and where each edge e E E is endowed with a length 1(e) : 0 and a capacity c(e) > 0. For a path P that connects u and v, the transmission ... 详细信息
来源: 评论
approximation algorithms for the maximum multiple RNA interaction problem
Approximation algorithms for the maximum multiple RNA intera...
收藏 引用
7th International Conference on Combinatorial Optimization and Applications, COCOA 2013
作者: Tong, Weitian Goebel, Randy Liu, Tian Lin, Guohui Department of Computing Science University of Alberta Edmonton AB T6G 2E8 Canada Key Laboratory of High Confidence Software Technologies Ministry of Education Institute of Software School of Electronic Engineering and Computer Science Peking University Beijing 100871 China
RNA interactions are fundamental in many cellular processes, which can involve two or more RNA molecules. Multiple RNA interactions are also believed to be much more complex than pairwise interactions. Recently, multi... 详细信息
来源: 评论
approximation algorithms for Distributionally Robust Stochastic Optimization
Approximation Algorithms for Distributionally Robust Stochas...
收藏 引用
作者: Linhares Rodrigues, Andre University of Waterloo
学位级别:博士
Two-stage stochastic optimization is a widely used framework for modeling uncertainty, where we have a probability distribution over possible realizations of the data, called scenarios, and decisions are taken in two ... 详细信息
来源: 评论
approximation algorithms for min-k-overlap problems using the principal lattice of partitions approach  19th
Approximation algorithms for min-k-overlap problems using th...
收藏 引用
19th International Symposium on Mathematical Foundations of Computer Science, MFCS 1994
作者: Narayanan, H. Roy, Subir Patkar, Sachin Deptt. of Elec. Engg. IIT Bombay400076 India Deptt. of Elec. Engg. IIT Kanpur208016 India Forschungsinstitut für Diskrete Mathematik Universität Bonn Germany
In this paper we have shown the utility of the Principal Lattice of Partitions approach to the construction of approximate algorithms for the Min-k-overlap problem. In particular we give an improved performance guaran... 详细信息
来源: 评论
approximation algorithms for geometric dispersion
Approximation algorithms for geometric dispersion
收藏 引用
作者: Alfonso Bolivar CEVALLOS MANZANO ECOLE POLYTECHNIQUE FEDERALE DE LAUSANNE
学位级别:博士
The most basic form of the max-sum dispersion problem ( MSD ) is as follows: given n points in R q and an integer k, select a set of k points such that the sum of the pairwise distances within the set is maximal. This... 详细信息
来源: 评论
approximation algorithms for Scheduling and Fair Allocations
Approximation Algorithms for Scheduling and Fair Allocations
收藏 引用
作者: Zhang, Yihao University of Washington
学位级别:Ph.D., Doctor of Philosophy
In this thesis, we will have discussions on two main topics, max-min allocation and scheduling jobs with precedent constraints on machines with communication delays. New approximation algorithms are given in Chapter 2... 详细信息
来源: 评论
From Theory to Practice: Engineering approximation algorithms for Dynamic Orientation
arXiv
收藏 引用
arXiv 2025年
作者: Großmann, Ernestine van der Hoog, Ivor Reinstädtler, Henrik Rotenberg, Eva Schulz, Christian Vlieghe, Juliette Heidelberg University Germany Technical University of Denmark Denmark
Dynamic graph algorithms have seen significant theoretical advancements, but practical evaluations often lag behind. This work bridges the gap between theory and practice by engineering and empirically evaluating rece... 详细信息
来源: 评论
approximation algorithms for minimum size 2-connectivity problems  18th
收藏 引用
18th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2001
作者: Krysta1, Piotr Anil Kumar, V.S. Max-Planck-Institut f¨ur Informatik Stuhlsatzenhausweg 85 SaarbrückenD-66123 Germany
We study some versions of the problem of finding the minimum size 2-connected subgraph. This problem is NP-hard (even on cubic planar graphs) and MAX SNP-hard. We show that the minimum 2-edge connected subgraph proble... 详细信息
来源: 评论
approximation algorithms for stochastic boolean function evaluation and stochastic submodular set cover
Approximation algorithms for stochastic boolean function eva...
收藏 引用
25th Annual ACM-SIAM Symposium on Discrete algorithms, SODA 2014
作者: Deshpande, Amol Hellerstein, Lisa Kletenik, Devorah University of Maryland United States Polytechnic Institute of NYU United States
We present approximation algorithms for two problems: Stochastic Boolean Function Evaluation (SBFE) and Stochastic Submodular Set Cover (SSSC). Our results for SBFE problems are obtained by reducing them to SSSC probl... 详细信息
来源: 评论