咨询与建议

限定检索结果

文献类型

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

馆藏范围

  • 32,005 篇 电子文献
  • 1 种 纸本馆藏

日期分布

学科分类号

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

主题

  • 32,005 篇 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,281 篇 英文
  • 575 篇 其他
  • 114 篇 中文
  • 9 篇 日文
  • 7 篇 俄文
  • 4 篇 法文
  • 2 篇 西班牙文
  • 1 篇 德文
  • 1 篇 葡萄牙文
  • 1 篇 土耳其文
检索条件"主题词=approximation algorithms"
32005 条 记 录,以下是101-110 订阅
approximation algorithms for the workload partition problem and applications to scheduling with variable processing times
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2017年 第2期256卷 384-391页
作者: Oron, Daniel Shabtay, Dvir Steiner, George Univ Sydney Sch Business Sydney NSW 2006 Australia Ben Gurion Univ Negev Dept Ind Engn & Management Beer Sheva Israel McMaster Univ Operat Management Area Hamilton ON Canada
In the Workload Partition Problem (WPP) we are given a set of n jobs to be scheduled on a set of m identical parallel machines. Each job has its own workload and the scheduling cost on each machine is a convex functio... 详细信息
来源: 评论
approximation algorithms for Throughput Maximization in Wireless Networks With Delay Constraints
收藏 引用
IEEE-ACM TRANSACTIONS ON NETWORKING 2013年 第6期21卷 1988-2000页
作者: Pei, Guanhong Parthasarathy, Srinivasan Srinivasan, Aravind Vullikanti, Anil Kumar S. Virginia Tech Dept Elect & Comp Engn Blacksburg VA 24061 USA Virginia Tech Virginia Bioinformat Inst Blacksburg VA 24061 USA IBM TJ Watson Res Ctr Hawthorne NY 10532 USA Univ Maryland Dept Comp Sci College Pk MD 20742 USA Univ Maryland Inst Adv Comp Studies College Pk MD 20742 USA Virginia Tech Dept Comp Sci Blacksburg VA 24061 USA
We study the problem of throughput maximization in multihop wireless networks with end-to-end delay constraints for each session. This problem has received much attention starting with the work of Grossglauser and Tse... 详细信息
来源: 评论
approximation algorithms for the a priori traveling repairman
收藏 引用
OPERATIONS RESEARCH LETTERS 2020年 第5期48卷 599-606页
作者: Navidi, Fatemeh Li Gortz, Inge Nagarajan, Viswanath Univ Michigan Ann Arbor MI 48109 USA Tech Univ Denmark DTU Compute Lyngby Denmark
We consider the a priori traveling repairman problem, which is a stochastic version of the classic traveling repairman problem. Given a metric (V, d) with a root r is an element of V, the traveling repairman problem (... 详细信息
来源: 评论
approximation algorithms for Optimal Decision Trees and Adaptive TSP Problems
收藏 引用
MATHEMATICS OF OPERATIONS RESEARCH 2017年 第3期42卷 876-896页
作者: Gupta, Anupam Nagarajan, Viswanath Ravi, R. Carnegie Mellon Univ Dept Comp Sci Pittsburgh PA 15213 USA Univ Michigan Ind & Operat Engn Dept Ann Arbor MI 48109 USA Carnegie Mellon Univ Tepper Sch Business Pittsburgh PA 15213 USA
We consider the problem of constructing optimal decision trees: given a collection of tests that can disambiguate between a set of m possible diseases, each test having a cost, and the a priori likelihood of any parti... 详细信息
来源: 评论
approximation algorithms for constrained generalized tree alignment problem
收藏 引用
DISCRETE APPLIED MATHEMATICS 2009年 第7期157卷 1407-1422页
作者: Divakaran, Srikrishnan Hofstra Univ Dept Comp Sci Hempstead NY 11549 USA
In generalized tree alignment problem, we are given a set S of k biologically related sequences and we are interested in a minimum cost evolutionary tree for S. In many instances of this problem partial phylogenetic t... 详细信息
来源: 评论
approximation algorithms for the metric maximum clustering problem with given cluster sizes
收藏 引用
OPERATIONS RESEARCH LETTERS 2003年 第3期31卷 179-184页
作者: Hassin, R Rubinstein, S Tel Aviv Univ Sch Math Sci Dept Stat & Operat Res IL-69978 Tel Aviv Israel
The input to the METRIC MAXIMUM CLUSTERING PROBLEM WITH GIVEN CLUSTER SIZES consists of a complete graph G=(V, E) with edge weights satisfying the triangle inequality, and integers c(1),...., c(p) that sum to I V. The... 详细信息
来源: 评论
approximation algorithms for sorting permutations by extreme block-interchanges
收藏 引用
THEORETICAL COMPUTER SCIENCE 2021年 891卷 105-115页
作者: Pai, Jayakumar Chitturi, Bhadrachalam Amrita Vishwa Vidyapeetham Dept Comp Sci & Applicat Amritapuri India Univ Texas Dallas Dept Comp Sci Richardson TX 75083 USA
Sorting permutations with various operations has applications in macro rearrangement of genes in a genome and the design of computer interconnection networks. Block-interchange is a powerful operation that swaps two s... 详细信息
来源: 评论
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... 详细信息
来源: 评论
approximation algorithms for Capacitated Stochastic Inventory Systems with Setup Costs
收藏 引用
NAVAL RESEARCH LOGISTICS 2014年 第4期61卷 304-319页
作者: Shi, Cong Zhang, Huanan Chao, Xiuli Levi, Retsef Univ Michigan Ann Arbor MI 48109 USA MIT Sloan Sch Management Cambridge MA 02139 USA
We develop the first approximation algorithm with worst-case performance guarantee for capacitated stochastic periodic-review inventory systems with setup costs. The structure of the optimal control policy for such sy... 详细信息
来源: 评论
approximation algorithms for channel assignment with constraints
收藏 引用
THEORETICAL COMPUTER SCIENCE 2001年 第1-2期262卷 649-667页
作者: Janssen, J Narayanan, L Dalhousie Univ Dept Math Stat & Comp Sci Halifax NS B3H 3J5 Canada Concordia Univ Dept Comp Sci Montreal PQ H3G 1M8 Canada
Cellular networks are generally modeled as node-weighted graphs, where the nodes represent cells and the edges represent the possibility of radio interference. An algorithm for the channel assignment problem must assi... 详细信息
来源: 评论