咨询与建议

限定检索结果

文献类型

  • 12 篇 期刊文献
  • 4 篇 会议
  • 1 篇 学位论文

馆藏范围

  • 17 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 13 篇 工学
    • 12 篇 计算机科学与技术...
    • 4 篇 电气工程
    • 2 篇 信息与通信工程
    • 2 篇 软件工程
    • 1 篇 机械工程
    • 1 篇 控制科学与工程
  • 6 篇 理学
    • 6 篇 数学
  • 4 篇 管理学
    • 4 篇 管理科学与工程(可...
    • 1 篇 工商管理
  • 1 篇 经济学
    • 1 篇 应用经济学

主题

  • 17 篇 polynomial-time ...
  • 3 篇 approximation al...
  • 3 篇 computational co...
  • 3 篇 approximation me...
  • 3 篇 semidefinite pro...
  • 2 篇 approximation th...
  • 2 篇 worst-case perfo...
  • 2 篇 chinese postman ...
  • 2 篇 heuristic
  • 2 篇 complexity
  • 1 篇 idle time durati...
  • 1 篇 traveling salesm...
  • 1 篇 tree-hierarchica...
  • 1 篇 subtasks executi...
  • 1 篇 keywords max dic...
  • 1 篇 makespan minimiz...
  • 1 篇 np-hard
  • 1 篇 compatibility co...
  • 1 篇 correlation deca...
  • 1 篇 nonpreemptive sc...

机构

  • 1 篇 univ coll cork i...
  • 1 篇 yahoo labs barce...
  • 1 篇 tsing hua univ d...
  • 1 篇 seoul natl univ ...
  • 1 篇 tanta univ fac s...
  • 1 篇 univ newcastle d...
  • 1 篇 heinrich heine u...
  • 1 篇 ain shams univ f...
  • 1 篇 suny stony brook...
  • 1 篇 new jersey inst ...
  • 1 篇 univ montpellier...
  • 1 篇 lirmm inst biol ...
  • 1 篇 old dominion uni...
  • 1 篇 instituteofappli...
  • 1 篇 univ montpellier...
  • 1 篇 phenikaa univ or...
  • 1 篇 georgia inst tec...
  • 1 篇 virginia polytec...
  • 1 篇 chinese acad sci...
  • 1 篇 huawei technol c...

作者

  • 2 篇 giroudeau rodolp...
  • 2 篇 ye yy
  • 2 篇 frederickson gn
  • 2 篇 darties benoit
  • 2 篇 simonin gilles
  • 1 篇 essa hanaa a. e.
  • 1 篇 konig jean-claud...
  • 1 篇 xu dc
  • 1 篇 daoud sameh s.
  • 1 篇 qingyu liu
  • 1 篇 bonchi francesco
  • 1 篇 han jy
  • 1 篇 hecht ms
  • 1 篇 kim ce
  • 1 篇 lin shih-chun
  • 1 篇 luo zq
  • 1 篇 zhang lp
  • 1 篇 giroudeau r.
  • 1 篇 zhou pengzhan
  • 1 篇 garcia-soriano d...

语言

  • 17 篇 英文
检索条件"主题词=Polynomial-time approximation algorithm"
17 条 记 录,以下是1-10 订阅
Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints
收藏 引用
THEORETICAL COMPUTER SCIENCE 2021年 858卷 35-48页
作者: Nguyen, Trung Thanh Rothe, Joerg Phenikaa Univ ORLab Fac Comp Sci Hanoi 12116 Vietnam Heinrich Heine Univ Dusseldorf Inst Informat D-40225 Dusseldorf Germany
We study a generalized version of the load balancing problem on unrelated machines with cost constraints: Given a set of m machines (of certain types) and a set of n jobs, each job j processed on machine i requires p(... 详细信息
来源: 评论
Design and Optimization of Electric Autonomous Vehicles with Renewable Energy Source for Smart Cities  38
Design and Optimization of Electric Autonomous Vehicles with...
收藏 引用
39th IEEE International Conference on Computer Communications (IEEE INFOCOM)
作者: Zhou, Pengzhan Wang, Cong Yang, Yuanyuan SUNY Stony Brook Dept Elect & Comp Engn Stony Brook NY 11794 USA Old Dominion Univ Dept Comp Sci Norfolk VA 23529 USA
Electric autonomous vehicles provide a promising solution to the traffic congestion and air pollution problems in future smart cities. Considering intensive energy consumption, charging becomes of paramount importance... 详细信息
来源: 评论
Delay-Aware Multi-Path Routing In A Multi-Hop Network: algorithms And Applications
Delay-Aware Multi-Path Routing In A Multi-Hop Network: Algor...
收藏 引用
作者: Qingyu Liu Virginia Polytechnic Institute and State University
学位级别:博士
Delay is known to be a critical performance metric for various real-world routing applications including multimedia communication and freight delivery. Provisioning delay-minimal (or at least delay-bounded) routing se... 详细信息
来源: 评论
SOME COMPLEXITY AND approximation RESULTS FOR COUPLED-TASKS SCHEDULING PROBLEM ACCORDING TO TOPOLOGY
收藏 引用
RAIRO-OPERATIONS RESEARCH 2016年 第4-5期50卷 781-795页
作者: Darties, Benoit Giroudeau, Rodolphe Konig, Jean-Claude Simonin, Gilles Univ Burgundy UMR CNRS 6306 LE2I 8 Rue Alain Savary F-21000 Dijon France Univ Montpellier UMR CNRS 5506 LIRMM 161 Rue Ada F-34392 Montpellier 5 France Univ Coll Cork Insight Ctr Data Analyt Cork Ireland
We consider the makespan minimization coupled-tasks problem in presence of compatibility constraints with a specified topology. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same su... 详细信息
来源: 评论
Control traffic balancing in software defined networks
收藏 引用
COMPUTER NETWORKS 2016年 第0期106卷 260-271页
作者: Lin, Shih-Chun Wang, Pu Luo, Min Georgia Inst Technol Sch Elect & Comp Engn Broadband Wireless Networking Lab Atlanta GA 30332 USA Wichita State Univ Dept Elect Engn & Comp Sci Wichita KS 67260 USA Huawei Technol Co Ltd Shannon Lab Santa Clara CA USA
To promise on-line and adaptive traffic engineering in software defined networks (SDNs), the control messages, e.g., the first packet of every new flow and network traffic statistics, should be forwarded from software... 详细信息
来源: 评论
A complexity and approximation framework for the maximization scaffolding problem
收藏 引用
THEORETICAL COMPUTER SCIENCE 2015年 595卷 92-106页
作者: Chateau, A. Giroudeau, R. Univ Montpellier LIRMM UMR CNRS 5506 F-34392 Montpellier 5 France LIRMM Inst Biol Computat F-34090 Montpellier France
We explore in this paper some complexity issues inspired by the contig scaffolding problem in bioinformatics. We focus on the following problem: given an undirected graph with no loop, and a perfect matching on this g... 详细信息
来源: 评论
approximation algorithm for constrained coupled-tasks scheduling problem
Approximation algorithm for constrained coupled-tasks schedu...
收藏 引用
2nd International Conference on Control, Decision and Information Technologies (CoDIT)
作者: Simonin, Gilles Darties, Benoit Koenig, Jean-Claude Giroudeau, Rodolphe Univ Montpellier 2 LIRMM CNRS UMR 5506 F-34392 Montpellier 5 France
We tackle the makespan minimization coupledtasks problem in presence of compatibility constraints. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and id... 详细信息
来源: 评论
Graph Summarization with Quality Guarantees  14
Graph Summarization with Quality Guarantees
收藏 引用
14th IEEE International Conference on Data Mining (IEEE ICDM)
作者: Riondato, Matteo Garcia-Soriano, David Bonchi, Francesco Stanford Univ Stanford CA 94305 USA Yahoo Labs Barcelona Spain
We study the problem of graph summarization. Given a large graph we aim at producing a concise lossy representation that can be stored in main memory and used to approximately answer queries about the original graph m... 详细信息
来源: 评论
A Distributed Deterministic approximation algorithm for Data Association
A Distributed Deterministic Approximation Algorithm for Data...
收藏 引用
7th IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS)
作者: Oh, Songhwai Seoul Natl Univ ASRI Sch Elect Engn & Comp Sci Seoul South Korea
The data association problem appears in many applications and is considered as the most challenging problem in intelligent systems. In this paper, we consider the Bayesian formulation of data association problems and ... 详细信息
来源: 评论
Fast approximation algorithms for job scheduling with processing set restrictions
收藏 引用
THEORETICAL COMPUTER SCIENCE 2010年 第44-46期411卷 3947-3955页
作者: Huo, Yumei Leung, Joseph Y-T New Jersey Inst Technol Dept Comp Sci Newark NJ 07102 USA CUNY Dept Comp Sci Staten Isl NY 10314 USA
We consider the problem of scheduling n independent jobs on m parallel machines, where the machines differ in their functionality but not in their processing speeds. Each job has a restricted set of machines to which ... 详细信息
来源: 评论