咨询与建议

限定检索结果

文献类型

  • 2,427 篇 期刊文献
  • 770 篇 会议
  • 24 篇 学位论文
  • 4 册 图书

馆藏范围

  • 3,225 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 2,344 篇 工学
    • 2,004 篇 计算机科学与技术...
    • 476 篇 电气工程
    • 378 篇 信息与通信工程
    • 337 篇 软件工程
    • 76 篇 机械工程
    • 74 篇 控制科学与工程
    • 69 篇 电子科学与技术(可...
    • 29 篇 交通运输工程
    • 28 篇 仪器科学与技术
    • 11 篇 材料科学与工程(可...
    • 8 篇 土木工程
    • 6 篇 力学(可授工学、理...
    • 6 篇 测绘科学与技术
    • 6 篇 石油与天然气工程
    • 6 篇 生物工程
  • 1,648 篇 理学
    • 1,595 篇 数学
    • 28 篇 生物学
    • 26 篇 统计学(可授理学、...
    • 18 篇 物理学
    • 11 篇 系统科学
    • 10 篇 化学
    • 3 篇 地球物理学
  • 897 篇 管理学
    • 889 篇 管理科学与工程(可...
    • 236 篇 工商管理
    • 5 篇 图书情报与档案管...
  • 243 篇 经济学
    • 235 篇 应用经济学
    • 7 篇 理论经济学
  • 11 篇 法学
    • 8 篇 法学
    • 3 篇 社会学
  • 10 篇 医学
    • 5 篇 临床医学
  • 8 篇 军事学
  • 4 篇 农学
  • 2 篇 艺术学
  • 1 篇 教育学

主题

  • 3,225 篇 approximation al...
  • 222 篇 scheduling
  • 81 篇 combinatorial op...
  • 73 篇 approximation al...
  • 68 篇 np-hard
  • 68 篇 computational co...
  • 65 篇 np-hardness
  • 64 篇 linear programmi...
  • 61 篇 np-complete
  • 56 篇 optimization
  • 53 篇 facility locatio...
  • 51 篇 traveling salesm...
  • 51 篇 graph algorithm
  • 45 篇 worst-case analy...
  • 45 篇 wireless sensor ...
  • 45 篇 vertex cover
  • 45 篇 makespan
  • 45 篇 network design
  • 43 篇 computational ge...
  • 43 篇 dynamic programm...

机构

  • 52 篇 univ alberta dep...
  • 49 篇 univ texas dalla...
  • 38 篇 shandong jianzhu...
  • 37 篇 iit dept comp sc...
  • 36 篇 nanjing univ sta...
  • 34 篇 tianjin univ tec...
  • 33 篇 city univ hong k...
  • 32 篇 univ new brunswi...
  • 31 篇 shandong normal ...
  • 29 篇 shandong univ sc...
  • 27 篇 renmin univ chin...
  • 24 篇 yunnan univ sch ...
  • 24 篇 chinese acad sci...
  • 23 篇 hangzhou dianzi ...
  • 20 篇 beijing univ tec...
  • 18 篇 zhejiang normal ...
  • 17 篇 beijing univ tec...
  • 17 篇 beijing univ tec...
  • 17 篇 univ wisconsin d...
  • 16 篇 univ texas dalla...

作者

  • 92 篇 xu dachuan
  • 52 篇 du donglei
  • 49 篇 wu weili
  • 47 篇 lin guohui
  • 44 篇 wu chenchen
  • 44 篇 zhang zhao
  • 42 篇 li deying
  • 34 篇 zhang dongmei
  • 30 篇 li min
  • 30 篇 du ding-zhu
  • 29 篇 chen yong
  • 28 篇 zhang an
  • 27 篇 yu wei
  • 25 篇 liu zhaohui
  • 25 篇 wang wei
  • 25 篇 li weidong
  • 25 篇 chen guihai
  • 24 篇 dai haipeng
  • 24 篇 dumitrescu adria...
  • 24 篇 zhang peng

语言

  • 2,996 篇 英文
  • 216 篇 其他
  • 13 篇 中文
  • 3 篇 法文
  • 2 篇 德文
检索条件"主题词=approximation algorithm"
3225 条 记 录,以下是321-330 订阅
排序:
An improved approximation algorithm for single machine scheduling with job delivery
收藏 引用
THEORETICAL COMPUTER SCIENCE 2011年 第3期412卷 270-274页
作者: Liu, Peihai Lu, Xiwen E China Univ Sci & Technol Dept Math Sch Sci Shanghai 200237 Peoples R China
In single machine scheduling with release times and job delivery, jobs are processed on single machine and then delivered by a capacitated vehicle to a single customer. Only one vehicle is employed to deliver these jo... 详细信息
来源: 评论
An approximation algorithm for two-dimensional warping
收藏 引用
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2000年 第1期E83D卷 109-111页
作者: Uchida, S Sakoe, H Kyushu Univ Grad Sch Informat Sci & Elect Engn Fukuoka 8128581 Japan
A new efficient two-dimensional warping algorithm is presented, in which sub-optimal warping is attained by iterating DP-based local optimization of warp on partially overlapping subplane sequence. From an experimenta... 详细信息
来源: 评论
An improved approximation algorithm for the capacitated multicast tree routing problem
收藏 引用
2nd International Conference on Combinatorial Optimization and Applications
作者: Cai, Zhipeng Chen, Zhi-Zhong Lin, Guohui Wang, Lusheng Univ Alberta Dept Comp Sci Edmonton AB T6G 2E8 Canada Tokyo Denki Univ Dept Math Sci Hatoyama Saitama 35003 Japan City Univ Hong Kong Dept Comp Sci Kowloon Peoples R China
The Capacitated Multicast Tree Routing Problem is considered, in which only a limited number of destination nodes are allowed to receive data in one routing tree and multiple routing trees are needed to send data from... 详细信息
来源: 评论
A Guaranteed approximation algorithm for Scheduling Fork-Joins with Communication Delay  37
A Guaranteed Approximation Algorithm for Scheduling Fork-Joi...
收藏 引用
37th IEEE International Parallel and Distributed Processing Symposium (IPDPS)
作者: Dutot, Pierre-Francois Fu, Yeu-Shin Prasad, Nikhil Sinnen, Oliver Unin Grenoble Alpes CNRS INRIA Grenoble INPLIG F-38000 Grenoble France Univ Auckland Parallel & Reconfigurable Comp Lab Dept Elect Comp & Software Engn Auckland New Zealand
Scheduling task graphs with communication delay is a widely studied NP-hard problem. Many heuristics have been proposed, but there is no constant approximation algorithm for this classic model. In this paper, we focus... 详细信息
来源: 评论
approximation algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs
收藏 引用
Journal of Computer Science and Technology 2008年 第5期23卷 763-768页
作者: JianXin Wang XiaoShuang Xu JianEr Chen School of Information Science and Engineering Central South University Changsha 410083
The constrained minimum vertex cover problem on bipartite graphs (the Min-CVCB problem) is an important NP-complete problem. This paper presents a polynomial time approximation algorithm for the problem based on the t... 详细信息
来源: 评论
Vertex Cover Problem-Revised approximation algorithm
Vertex Cover Problem-Revised Approximation Algorithm
收藏 引用
International Conference on Artificial Intelligence and Evolutionary algorithms in Engineering Systems (ICAEES)
作者: Shah, Kartik Reddy, Praveenkumar Selvakumar, R. VIT Univ Sch Comp Sci & Engn Vellore 632014 Tamil Nadu India
This paper is aimed to present the solution to vertex cover problem by means of an approximation solution. As it is NP complete problem, we can have an approximate time algorithm to solve the vertex cover problem. We ... 详细信息
来源: 评论
An approximation algorithm for the Dynamic k-level Facility Location Problem  13th
An Approximation Algorithm for the Dynamic k-level Facility ...
收藏 引用
13th International Conference on algorithmic Aspects in Information and Management (AAIM)
作者: Wang, Limin Zhang, Zhao Xu, Dachuan Zhang, Xiaoyan Nanjing Univ State Key Lab Novel Software Technol Nanjing 210023 Jiangsu Peoples R China Zhejiang Normal Univ Coll Math & Comp Sci Jinhua 321004 Zhejiang Peoples R China Beijing Univ Technol Beijing Inst Sci & Engn Comp Beijing 100124 Peoples R China Nanjing Normal Univ Sch Math Sci Nanjing 210023 Peoples R China Nanjing Normal Univ Inst Math Nanjing 210023 Peoples R China
In this paper, we consider the dynamic k-level facility location problem, which is a generalization of the uncapacitated k-level facility location problem when considering time factor. We present a combinatorial prima... 详细信息
来源: 评论
An improved approximation algorithm for single machine scheduling with job delivery
An improved approximation algorithm for single machine sched...
收藏 引用
3rd International Conference on Combinatorial Optimization and Applications (COCOA 2009)
作者: Liu, Peihai Lu, Xiwen E China Univ Sci & Technol Dept Math Sch Sci Shanghai 200237 Peoples R China
In single machine scheduling with release times and job delivery, jobs are processed on single machine and then delivered by a capacitated vehicle to a single customer. Only one vehicle is employed to deliver these jo... 详细信息
来源: 评论
A parallel approximation algorithm for resource constrained scheduling and bin packing  4th
A parallel approximation algorithm for resource constrained ...
收藏 引用
4th International Symposium on Solving Irregularly Structured Problems in Parallel (IRREGULAR 97)
作者: Srivastav, A Stangier, P Humboldt Univ Inst Informat D-10099 Berlin Germany Univ Cologne Zentrum Paralleles Rech D-50931 Cologne Germany
(1) We consider the following classical resource constrained scheduling problem. Given m identical processors, s resources R-1,..., R-s with upper bounds b(1),..., b(s), n independent jobs T-1,...,T-n of unit length, ... 详细信息
来源: 评论
Learning based approximation algorithm: A Case Study in Learning through Gaming  11
Learning based Approximation Algorithm: A Case Study in Lear...
收藏 引用
11th International Conference on Advanced Computing (ICoAC)
作者: Padmanabhan, Jayashree Bala, Geetha P. Rajkumar, S. Anna Univ Dept Comp Technol MIT Campus Chennai Tamil Nadu India Prince Dr K Vasudevan Coll Engn & Technol Dept ECE Chennai Tamil Nadu India Citicorps Ltd Chennai Tamil Nadu India
With new learning technologies springing up, gaming also plays a vital role in creating learning experiences. Studies show that games play an active role in defining active and creative learning activities. For effect... 详细信息
来源: 评论