咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 2,303 篇 工学
    • 2,002 篇 计算机科学与技术...
    • 475 篇 电气工程
    • 337 篇 信息与通信工程
    • 333 篇 软件工程
    • 76 篇 机械工程
    • 74 篇 控制科学与工程
    • 70 篇 电子科学与技术(可...
    • 28 篇 仪器科学与技术
    • 28 篇 交通运输工程
    • 11 篇 材料科学与工程(可...
    • 8 篇 土木工程
    • 6 篇 力学(可授工学、理...
    • 6 篇 测绘科学与技术
    • 6 篇 石油与天然气工程
    • 6 篇 生物工程
    • 3 篇 环境科学与工程(可...
  • 1,645 篇 理学
    • 1,592 篇 数学
    • 28 篇 生物学
    • 25 篇 统计学(可授理学、...
    • 18 篇 物理学
    • 11 篇 系统科学
    • 10 篇 化学
    • 3 篇 地球物理学
  • 897 篇 管理学
    • 890 篇 管理科学与工程(可...
    • 235 篇 工商管理
    • 5 篇 图书情报与档案管...
    • 3 篇 公共管理
  • 239 篇 经济学
    • 235 篇 应用经济学
    • 3 篇 理论经济学
  • 8 篇 医学
    • 5 篇 临床医学
  • 8 篇 军事学
  • 4 篇 农学
  • 2 篇 法学
  • 2 篇 艺术学
  • 1 篇 教育学

主题

  • 3,220 篇 approximation al...
  • 222 篇 scheduling
  • 80 篇 combinatorial op...
  • 72 篇 approximation al...
  • 68 篇 np-hard
  • 68 篇 computational co...
  • 65 篇 np-hardness
  • 63 篇 linear programmi...
  • 61 篇 np-complete
  • 55 篇 optimization
  • 53 篇 facility locatio...
  • 51 篇 traveling salesm...
  • 51 篇 graph algorithm
  • 46 篇 wireless sensor ...
  • 45 篇 worst-case analy...
  • 45 篇 vertex cover
  • 45 篇 makespan
  • 45 篇 network design
  • 43 篇 computational ge...
  • 42 篇 dynamic programm...

机构

  • 52 篇 univ alberta dep...
  • 49 篇 univ texas dalla...
  • 38 篇 shandong jianzhu...
  • 37 篇 iit dept comp sc...
  • 37 篇 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 篇 dai haipeng
  • 25 篇 liu zhaohui
  • 25 篇 wang wei
  • 25 篇 li weidong
  • 25 篇 chen guihai
  • 24 篇 dumitrescu adria...
  • 24 篇 zhang peng

语言

  • 2,991 篇 英文
  • 216 篇 其他
  • 13 篇 中文
  • 3 篇 法文
  • 2 篇 德文
检索条件"主题词=Approximation algorithm"
3220 条 记 录,以下是291-300 订阅
排序:
approximation algorithm for optimal combinations of scopes in OSI management operations
收藏 引用
IEICE TRANSACTIONS ON COMMUNICATIONS 1997年 第6期E80B卷 881-887页
作者: Yoshihara, K Horiuchi, H Sugiyama, K Obana, S Research and Development Laboratories Kokusai Denshin Demva Co. Ltd. Kamifukuoka-shi 356 Japan
In OSI management, we utilize a scope parameter in Common Management Information Service (CMIS) that enables us to operate multiple Managed Objects (MOs) at one CMIS operation, so that we may reduce the number of comm... 详细信息
来源: 评论
An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2005年 第1期161卷 3-10页
作者: Sadfi, C Penz, B Rapine, C Blazewicz, J Formanowicz, P Lab GILCO F-38031 Grenoble 1 France Poznan Univ Tech Inst Comp Sci PL-60965 Poznan Poland
In this paper, we study the single machine total completion scheduling problem subject to a period of maintenance. We propose an approximation algorithm to solve the problem with a worst case error bound of 3/17. Furt... 详细信息
来源: 评论
A SELF-STABILIZING DISTRIBUTED approximation algorithm FOR THE MINIMUM CONNECTED DOMINATING SET
收藏 引用
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2010年 第3期21卷 459-476页
作者: Kamei, Sayaka Kakugawa, Hirotsugu Hiroshima Univ Dept Informat Engn Hiroshima 7398527 Japan Osaka Univ Dept Comp Sci Osaka 5608531 Japan
Self-stabilization is a theoretical framework of non-masking fault-tolerant distributed algorithms. A self-stabilizing system tolerates any kind and any finite number of transient faults, such as message loss, memory ... 详细信息
来源: 评论
A POLYNOMIAL-TIME approximation algorithm FOR A GEOMETRIC DISPERSION PROBLEM
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS 2009年 第3期19卷 267-288页
作者: Benkert, Marc Gudmundsson, Joachim Knauer, Christian Van Oostrum, Rene Wolff, Alexander XP Software Belconnen ACT Australia Natl ICT Australia Ltd Sydney NSW Australia Free Univ Berlin Inst Comp Sci D-1000 Berlin Germany ORTEC Bv Gouda Netherlands Tech Univ Eindhoven Fac Wiskunde & Informat Eindhoven Netherlands
We consider the following packing problem. Let alpha be a fixed real in (0, 1]. We are given a bounding rectangle rho and a set R of n possibly intersecting unit disks whose centers lie in rho. The task is to pack a s... 详细信息
来源: 评论
An improved approximation algorithm for the two-machine flow shop scheduling problem with an interstage transporter
收藏 引用
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2007年 第3期18卷 565-591页
作者: Soper, Alan J. Strusevich, Vitaly A. Univ Greenwich Sch Comp & Math Sci London SE10 9LS England
We study the two-machine flow shop problem with an uncapacitated interstage transporter. The jobs have to be split into batches, and upon completion on the first machine, each batch has to be shipped to the second mac... 详细信息
来源: 评论
An O(log n)-approximation algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs
收藏 引用
ACM TRANSACTIONS ON algorithmS 2013年 第2期9卷 1–13页
作者: Kawarabayashi, Ken-Ichi Kobayashi, Yusuke Res Org Informat & Syst Natl Inst Informat Chiyoda Ku Tokyo 1018430 Japan Univ Tokyo Bunkyo Ku Tokyo 1138656 Japan
In this article, we study an approximation algorithm for the maximum edge-disjoint paths problem. In this problem, we are given a graph and a collection of pairs of vertices, and the objective is to find the maximum n... 详细信息
来源: 评论
approximation algorithm for the group Steiner network problem
收藏 引用
NETWORKS 2007年 第2期49卷 160-167页
作者: Penn, Michal Rozenfeld, Stas Technion Israel Inst Technol Fac Ind Engn & Management IL-32000 Haifa Israel
In this article we study the group Steiner network problem, which is defined in the following way. Given a graph G = (V,E), a partition of its vertices into K groups and connectivity requirements between the different... 详细信息
来源: 评论
A NEAR-TIGHT approximation algorithm FOR THE ROBOT LOCALIZATION PROBLEM
收藏 引用
SIAM JOURNAL ON COMPUTING 2009年 第2期39卷 461-490页
作者: Koenig, Sven Mitchell, Joseph S. B. Mudgal, Apurva Tovey, Craig Univ So Calif Dept Comp Sci Los Angeles CA 90089 USA SUNY Stony Brook Stony Brook NY 11794 USA Georgia Tech Coll Comp Atlanta GA 30332 USA
Localization is a fundamental problem in robotics. The "kidnapped robot" possesses a compass and map of its environment;it must determine its location at a minimum cost of travel distance. The problem is NP-... 详细信息
来源: 评论
A Primal-Dual approximation algorithm for the k-Level Stochastic Facility Location Problem
A Primal-Dual Approximation Algorithm for the <i>k</i>-Level...
收藏 引用
6th International Conference on algorithmic Aspects in Information and Management
作者: Wang, Zhen Du, Donglei Xu, Dachuan Beijing Univ Technol Dept Appl Math 100 Pingleyuan Beijing 100124 Peoples R China Univ New Brunswick Fac Business Adm Fredericton NB E3B 5A3 Canada
We present a combinatorial primal-dual 7-approximation algorithm for the k-level stochastic facility location problem, the stochastic counterpart of the standard k-level facility location problem. This approximation r... 详细信息
来源: 评论
A Novel approximation algorithm based on genetic programming in digital learning environment  4
A Novel approximation algorithm based on genetic programming...
收藏 引用
2015 International Conference of Educational Innovation Through Technology - (EITT)
作者: Li, Yaqin Yuan, Cao Zhang, Cong Li, Shigao Sun, Kaiqiong Wang, Xuan Wuhan Polytech Univ Sch Math & Comp Sci Wuhan 430023 Hubei Peoples R China Cent China Normal Univ Coll Hlth Sci & Nursing Wuhan 430023 Hubei Peoples R China
With the development of information and the integration of media, it has great practical significance and research value to build a digital learning environment based on the complicated electronic circuit. However, th... 详细信息
来源: 评论