咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是391-400 订阅
排序:
Scalability of Betweenness approximation algorithms: An Experimental Review
收藏 引用
IEEE ACCESS 2019年 7卷 104057-104071页
作者: Wandelt, Sebastian Shi, Xing Sun, Xiaoqian Beihang Univ Sch Elect & Informat Engn Beijing 100191 Peoples R China
Betweenness centrality, which measures the contribution of an individual node to the network's connectivity by counting the number of shortest paths a node appears in, is widely used for the analysis of the comple... 详细信息
来源: 评论
The ordered k-median problem: surrogate models and approximation algorithms
收藏 引用
MATHEMATICAL PROGRAMMING 2019年 第1-2期177卷 55-83页
作者: Aouad, Ali Segev, Danny London Business Sch London NW1 4SA England Univ Haifa Dept Stat IL-31905 Haifa Israel
In the last two decades, a steady stream of research has been devoted to studying various computational aspects of the ordered k-median problem, which subsumes traditional facility location problems (such as median, c... 详细信息
来源: 评论
Improved approximation algorithms for minimum power covering problems
收藏 引用
THEORETICAL COMPUTER SCIENCE 2019年 795卷 285-300页
作者: Calinescu, Gruia Kortsarz, Guy Nutov, Zeev IIT Chicago IL 60616 USA Rutgers State Univ Camden NJ USA Open Univ Israel Raanana Israel
Given an undirected graph with edge costs, the power of a node is the maximum cost of an edge incident to it, and the power of a graph is the sum of the powers of its nodes. Motivated by applications in wireless netwo... 详细信息
来源: 评论
General multilevel adaptations for stochastic approximation algorithms of Robbins-Monro and Polyak-Ruppert type
收藏 引用
NUMERISCHE MATHEMATIK 2019年 第2期142卷 279-328页
作者: Dereich, Steffen Mueller-Gronbach, Thomas Westfalische Wilhelms Univ Munster Inst Math Stat Fachbereich Math & Informat 10 Orleans Ring 10 D-48149 Munster Germany Univ Passau Fak Informat & Math Innstr 33 D-94032 Passau Germany
In this article we present and analyse new multilevel adaptations of classical stochastic approximation algorithms for the computation of a zero of a function f:DRd defined on a convex domain DRd, which is given as a ... 详细信息
来源: 评论
approximation algorithms for Connected Graph Factors of Minimum Weight
收藏 引用
THEORY OF COMPUTING SYSTEMS 2018年 第2期62卷 441-464页
作者: Cornelissen, Kamiel Hoeksma, Ruben Manthey, Bodo Narayanaswamy, N. S. Rahul, C. S. Waanders, Marten Univ Twente Enschede Netherlands Univ Chile Santiago Chile Indian Inst Technol Madras Chennai Tamil Nadu India
Finding low-cost spanning subgraphs with given degree and connectivity requirements is a fundamental problem in the area of network design. We consider the problem of finding d-regular spanning subgraphs (or d-factors... 详细信息
来源: 评论
approximation algorithms for a Class of Stochastic Selection Problems with Reward and Cost Considerations
收藏 引用
OPERATIONS RESEARCH 2018年 第3期66卷 834-848页
作者: Strinka, Zohar M. A. Romeijn, H. Edwin Mashey Denver CO 80202 USA Georgia Inst Technol H Milton Stewart Sch Ind & Syst Engn Atlanta GA 30332 USA
We study a class of problems with both binary selection decisions and associated continuous choices that result in stochastic rewards and costs. The rewards are received based on the decision maker's selection, an... 详细信息
来源: 评论
approximation algorithms for Three Dimensional Protein Folding
收藏 引用
FUNDAMENTA INFORMATICAE 2018年 第4期163卷 375-393页
作者: Shaw, Dipan Lal Islam, A. S. M. Shohidull Karmaker, Shuvasish Rahman, M. Sohel Univ Calif Riverside Dept CSE Riverside CA 92521 USA McMaster Univ Dept Computat Engn & Sci Hamilton ON Canada BUET Dept CSE Dhaka 1205 Bangladesh BUET Dept CSE AlEDA Grp ECE Bldg Dhaka 1205 Bangladesh
Predicting the secondary structure of a protein using a lattice model is one of the most studied computational problems in bioinformatics. Here the secondary structure or three dimensional structure of a protein is pr... 详细信息
来源: 评论
approximation algorithms for Minimum-Load k-Facility Location
收藏 引用
ACM TRANSACTIONS ON algorithms 2018年 第2期14卷 1–29页
作者: Ahmadian, Sara Behsaz, Babak Friggstad, Zachary Jorati, Amin Salavatipour, Mohammad R. Swamy, Chaitanya Univ Waterloo Dept Combinator & Optimizat Waterloo ON N2L 3G1 Canada Univ Alberta Dept Comp Sci Edmonton AB T6G 2E8 Canada
We consider a facility-location problem that abstracts settings where the cost of serving the clients assigned to a facility is incurred by the facility. Formally, we consider the minimnm-load klacility location (MLkF... 详细信息
来源: 评论
approximation algorithms for the Max-Buying Problem with Limited Supply
收藏 引用
ALGORITHMICA 2018年 第11期80卷 2973-2992页
作者: Fernandes, Cristina G. Schouery, Rafael C. S. Univ Sao Paulo Inst Matemat & Estat Rua Matao1010Cidade Univ BR-05508090 Sao Paulo SP Brazil Univ Estadual Campinas Inst Comp Av Albert Einstein1251Cidade Univ BR-13083852 Campinas SP Brazil
We consider the Max-Buying Problem with Limited Supply, in which there are n items, with copies of each item i, and m consumers such that each consumer b has a valuation for item i. The goal is to find a pricing p and... 详细信息
来源: 评论
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... 详细信息
来源: 评论