咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是401-410 订阅
排序:
approximation algorithms for the scaffolding problem and its generalizations
收藏 引用
THEORETICAL COMPUTER SCIENCE 2018年 734卷 131-141页
作者: Chen, Zhi-Zhong Harada, Youta Guo, Fei Wang, Lusheng Tokyo Denki Univ Div Informat Syst Design Hatoyama Saitama 3500394 Japan Tianjin Univ Sch Comp Sci & Technol Tianjin Peoples R China City Univ Hong Kong Dept Comp Sci 83 Tat Chee Ave Hong Kong Hong Kong Peoples R China Univ Hong Kong Shenzhen Res Inst Shenzhen Hitech Ind Pk Shenzhen Peoples R China
Scaffolding is one of the main stages in genome assembly. During this stage, we want to merge contigs assembled from the paired-end reads into bigger chains called scaffolds. For this purpose, the following graph-theo... 详细信息
来源: 评论
approximation algorithms and heuristics for task scheduling in data-intensive distributed systems
收藏 引用
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH 2018年 第5期25卷 1417-1441页
作者: Povoa, Marcelo G. Xavier, Eduardo C. Google Ave Andradas 3000 BR-30260070 Belo Hozitonte Brazil Univ Estadual Campinas Inst Comp Ave Albert Einstein 1251 BR-13083852 Campinas SP Brazil
In this work, we are interested in the problem of task scheduling on large-scale data-intensive computing systems. In order to achieve good performance, one must construct not only good task schedules but also good da... 详细信息
来源: 评论
approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces
收藏 引用
INFORMATION PROCESSING LETTERS 2018年 137卷 11-16页
作者: Lichen, Junran Li, Jianping Lih, Ko-Wei Yunnan Univ Dept Math Kunming 650091 Yunnan Peoples R China Acad Sinica Inst Math Taipei 10617 Taiwan
Motivated by the Steiner tree problem with minimum number of Steiner points and bounded edge-length in [4], we consider the problem of constructing specific subgraph with minimum number of length-bounded stock pieces ... 详细信息
来源: 评论
approximation algorithms FOR STOCHASTIC AND RISK-AVERSE OPTIMIZATION
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2018年 第1期32卷 44-63页
作者: Byrka, Jaroslaw Srinivasan, Aravind Univ Wroclaw Inst Comp Sci Joliot Curie 15 PL-50383 Wroclaw Poland Univ Maryland Dept Comp Sci College Pk MD 20742 USA Univ Maryland Inst Adv Comp Studies College Pk MD 20742 USA
We present improved approximation algorithms in stochastic optimization. We prove that the multistage stochastic versions of covering integer programs (such as set cover and vertex cover) admit essentially the same ap... 详细信息
来源: 评论
approximation algorithms FOR EULER GENUS AND RELATED PROBLEMS
收藏 引用
SIAM JOURNAL ON COMPUTING 2018年 第4期47卷 1610-1643页
作者: Chekuri, Chandra Sidiropoulos, Anastasios Univ Illinois Dept Comp Sci 1304 W Springfield Ave Urbana IL 61801 USA Univ Illinois Dept Comp Sci Chicago IL 60607 USA
The Euler genus of a graph is a fundamental and well-studied parameter in graph theory and topology. Computing it has been shown to be NP-hard by Thomassen [J. algorithms, 10 (1989), pp. 568-576;T. Combin. Theory, Ser... 详细信息
来源: 评论
approximation algorithms for k-echelon extensions of the one warehouse multi-retailer problem
收藏 引用
MATHEMATICAL METHODS OF OPERATIONS RESEARCH 2018年 第3期88卷 445-473页
作者: Stauffer, Gautier Kedge Business Sch Ctr Excellence Supply Chain CESIT Talence France
In this paper, we consider k-echelon extensions of the deterministic one warehouse multi-retailer problem. We give constant factor approximation algorithms for some of these extensions when k is fixed. We focus first ... 详细信息
来源: 评论
approximation algorithms for color spanning diameter
收藏 引用
INFORMATION PROCESSING LETTERS 2018年 135卷 53-56页
作者: Kazemi, Mohammad Reza Mohades, Ali Khanteimouri, Payam Amirkabir Univ Technol Tehran Polytech Tehran Iran Alzahra Univ Fac Math Sci Dept Comp Sci Tehran Iran
Minimum Diameter Color Spanning Set (MDCSS) on a given set of colored points is the problem of selecting one point from each color such that the diameter of the selected points gets minimized. In this paper, we presen... 详细信息
来源: 评论
approximation algorithms for Sorting Permutations by Length-Weighted Short Rearrangements
收藏 引用
Electronic Notes in Theoretical Computer Science 2019年 346卷 29-40页
作者: Alexsandro Oliveira Alexandrino Guilherme Henrique Santos Miranda Carla Negri Lintzmayer Zanoni Dias Institute of Computing University of Campinas (Unicamp) Brazil Center for Mathematics Computation and Cognition Federal University of ABC (UFABC) Brazil
Genome rearrangements are events that affect large portions of a genome. When using the rearrangement distance to compare two genomes, one wants to find a minimum cost sequence of rearrangements that transforms one in... 详细信息
来源: 评论
approximation algorithms in partitioning real-time tasks with replications
收藏 引用
INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS 2018年 第2期33卷 211-232页
作者: Lin, Jian (Denny) Cheng, Albert M. K. Gercek, Gokhan Univ Houston Clear Lake Dept Management Informat Syst Houston TX 77058 USA Univ Houston Dept Comp Sci Houston TX 77204 USA
Today is an era where multiprocessor technology plays a major role in designs of modern computer architecture. While multiprocessor systems offer extra computing power, it also opens a new range of opportunities to im... 详细信息
来源: 评论
Block Successive Convex approximation algorithms for Nonsmooth Nonconvex Optimization  53
Block Successive Convex Approximation Algorithms for Nonsmoo...
收藏 引用
53rd Asilomar Conference on Signals, Systems, and Computers (ACSSC)
作者: Yang, Yang Pesavento, Marius Luo, Zhi-Quan Ottersten, Bjorn Fraunhofer Inst Ind Math Kaiserslautern Germany Tech Univ Darmstadt Darmstadt Germany Chinese Univ Hong Kong Shenzhen Peoples R China Shenzhen Res Inst Big Data Shenzhen Peoples R China Univ Luxembourg Luxembourg Luxembourg
We propose a block successive convex approximation algorithm for large-scale nonsmooth nonconvex optimization problems. It is suitable for problems where the dimension exceeds the memory and/or the processing capabili... 详细信息
来源: 评论