咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是571-580 订阅
排序:
Fast approximation algorithms for the One-Warehouse Multi-Retailer Problem Under General Cost Structures and Capacity Constraints
收藏 引用
MATHEMATICS OF OPERATIONS RESEARCH 2017年 第3期42卷 854-875页
作者: Gayon, Jean-Philippe Massonnet, Guillaume Rapine, Christophe Stauffer, Gautier Univ Grenoble Alpes CNRS G SCOP F-38000 Grenoble France IMT Atlantique Lab LS2N F-44300 Nantes France Univ Lorraine Lab LGIPM F-57045 Metz 01 France
We consider a well-studied multi-echelon (deterministic) inventory control problem, known in the literature as the one-warehouse multi-retailer (OWMR) problem. We propose a simple and fast 2-approximation algorithm fo... 详细信息
来源: 评论
Different approximation algorithms for Channel Scheduling in Wireless Networks
收藏 引用
MOBILE INFORMATION SYSTEMS 2020年 第1期2020卷
作者: Ni, Qiufen Huang, Chuanhe Pardalos, Panos M. Ye, Jia Fu, Bin Wuhan Univ Sch Comp Sci Wuhan 430072 Peoples R China Collaborat Innovat Ctr Geospatial Technol Wuhan 430072 Peoples R China Univ Florida Dept Ind & Syst Engn Ctr Appl Optimizat Gainesville FL 32611 USA Higher Sch Econ LATNA Nizhnii Novgorod Russia Univ Texas Rio Grande Valley Dept Comp Sci Edinburg TX 78539 USA
We introduce a new two-side approximation method for the channel scheduling problem, which controls the accuracy of approximation in two sides by a pair of parameters (f, g). We present a series of simple and practica... 详细信息
来源: 评论
approximation algorithms for k-source bottleneck routing cost spanning tree problems
Approximation algorithms for k-source bottleneck routing cos...
收藏 引用
International Conference on Computational Science and its Applications, ICCSA 2004
作者: Chen, Yen Hung Wu, Bang Ye Tang, Chuan Yi Department of Computer Science National Tsing Hua University Hsinchu300 Taiwan Department of Computer Science and Information Engineering Shu-Te University YenChau Kaoshiung824 Taiwan
In this paper, we investigate two spanning tree problems of graphs with k given sources. Let G = (V, E,w) be an undirected graph with nonnegative edge lengths and S ⊂ V a set of k specified sources. The first problem ... 详细信息
来源: 评论
Two linear approximation algorithms for the subset-sum problem
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2000年 第2期120卷 289-296页
作者: Kellerer, H Mansini, R Speranza, MG Graz Univ Inst Stat Okonometrie & Operat Res A-8010 Graz Austria Dipartimento Metodi Quantitat I-25122 Brescia Italy
In this paper we study the subset-sum problem (SSP), which is the problem of finding, given a set of n positive integers and a knapsack of capacity c, a subset the sum of which is closest to c without exceeding the va... 详细信息
来源: 评论
IMPROVED approximation algorithms FOR SHOP SCHEDULING PROBLEMS
收藏 引用
SIAM JOURNAL ON COMPUTING 1994年 第3期23卷 617-632页
作者: SHMOYS, DB STEIN, C WEIN, J DARTMOUTH COLL DEPT MATH & COMP SCIHANOVERNH 03755 POLYTECH INST NEW YORK DEPT COMP SCIFIVE METROTECH CTRBROOKLYNNY 11201
In the job shop scheduling problem, there are m machines and n jobs. A job consists of a sequence of operations, each of which must be processed on a specified machine, and the aim is to complete all jobs as quickly a... 详细信息
来源: 评论
Fast approximation algorithms for Symmetric Constellation Subset Selection
收藏 引用
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2012年 第5期11卷 1655-1665页
作者: Huang, Scott C. -H. Wu, Hsiao-Chun Chang, Shih Yu Natl Tsing Hua Univ Dept Elect Engn Hsinchu Taiwan Louisiana State Univ Dept Elect & Comp Engn Baton Rouge LA 70803 USA Natl Tsing Hua Univ Dept Comp Sci Hsinchu Taiwan
Adaptive-modulation transceivers have been widely used in wireless communications nowadays. The tradeoff between symbol error rate and data rate can be tuned by adjusting the constellation size. In this paper, we prop... 详细信息
来源: 评论
Minimum Age of Information TDMA Scheduling: approximation algorithms and Hardness Results
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 2020年 第12期66卷 7652-7671页
作者: Kuo, Tung-Wei Natl Chengchi Univ Dept Comp Sci Taipei 11605 Taiwan
We consider a transmission scheduling problem in which multiple agents receive update information through a shared Time Division Multiple Access (TDMA) channel. To provide timely delivery of update information, the pr... 详细信息
来源: 评论
Improved approximation algorithms for Index Coding
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 2024年 第11期70卷 8266-8275页
作者: Chawin, Dror Haviv, Ishay Acad Coll Tel Aviv Yaffo Sch Comp Sci IL-61083 Tel Aviv Israel
The index coding problem is concerned with broadcasting encoded information to a collection of receivers in a way that enables each receiver to discover its required data based on its side information, which comprises... 详细信息
来源: 评论
Efficient approximation algorithms for adaptive influence maximization
收藏 引用
VLDB JOURNAL 2020年 第6期29卷 1385-1406页
作者: Huang, Keke Tang, Jing Han, Kai Xiao, Xiaokui Chen, Wei Sun, Aixin Tang, Xueyan Lim, Andrew Nanyang Technol Univ Sch Comp Sci & Engn Singapore Singapore Natl Univ Singapore Dept Ind Syst Engn & Management Singapore Singapore Univ Sci & Technol China Sch Comp Sci & Technol Hefei Peoples R China Natl Univ Singapore Sch Comp Singapore Singapore Microsoft Res Beijing Peoples R China
Given a social network G and an integer k, the influence maximization (IM) problem asks for a seed set S of k nodes from G to maximize the expected number of nodes influenced via a propagation model. The majority of t... 详细信息
来源: 评论
Parameterized and approximation algorithms for finding two disjoint matchings
收藏 引用
THEORETICAL COMPUTER SCIENCE 2014年 第0期556卷 85-93页
作者: Chen, Zhi-Zhong Fan, Ying Wang, Lusheng Tokyo Denki Univ Div Informat Syst Design Hatoyama Saitama 3500394 Japan City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China
We first present a randomized fixed-parameter algorithm for the NP-hard problem of deciding if there are two matchings M-1 and M-2 in a given graph G such that vertical bar M-1 vertical bar+ vertical bar M-2 vertical ... 详细信息
来源: 评论