咨询与建议

限定检索结果

文献类型

  • 59 篇 期刊文献
  • 17 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 55 篇 工学
    • 53 篇 计算机科学与技术...
    • 4 篇 电气工程
    • 4 篇 信息与通信工程
    • 4 篇 软件工程
    • 1 篇 机械工程
    • 1 篇 交通运输工程
  • 44 篇 理学
    • 44 篇 数学
  • 20 篇 管理学
    • 20 篇 管理科学与工程(可...
    • 9 篇 工商管理
  • 9 篇 经济学
    • 9 篇 应用经济学
  • 2 篇 军事学
  • 1 篇 教育学
    • 1 篇 教育学

主题

  • 76 篇 polynomial time ...
  • 16 篇 scheduling
  • 15 篇 approximation al...
  • 10 篇 approximation al...
  • 5 篇 capacitated vehi...
  • 4 篇 parallel machine...
  • 4 篇 fully polynomial...
  • 4 篇 dynamic programm...
  • 3 篇 np-hard
  • 3 篇 worst-case analy...
  • 3 篇 mobile edge comp...
  • 3 篇 makespan
  • 3 篇 unit disk graph
  • 3 篇 ptas
  • 3 篇 rejection penalt...
  • 2 篇 traveling salesm...
  • 2 篇 energy efficient
  • 2 篇 computation offl...
  • 2 篇 lower bound
  • 2 篇 vehicle scheduli...

机构

  • 5 篇 ural fed univ ek...
  • 5 篇 texas a&m univ d...
  • 5 篇 krasovsky inst m...
  • 4 篇 depaul univ sch ...
  • 4 篇 cent s univ coll...
  • 4 篇 lafayette coll d...
  • 4 篇 omsk state tech ...
  • 4 篇 univ texas dalla...
  • 3 篇 yunnan univ sch ...
  • 3 篇 arkansas state u...
  • 3 篇 hong kong polyte...
  • 2 篇 sun yat sen univ...
  • 2 篇 kunming univ sci...
  • 2 篇 shandong jianzhu...
  • 2 篇 bell labs murray...
  • 2 篇 univ alberta dep...
  • 2 篇 qujing normal un...
  • 2 篇 univ hong kong d...
  • 2 篇 yunnan univ peop...
  • 2 篇 new jersey inst ...

作者

  • 6 篇 li weidong
  • 5 篇 wang wei
  • 5 篇 khachay michael
  • 4 篇 xia ge
  • 4 篇 li jianping
  • 4 篇 kanj iyad a.
  • 4 篇 chen jianer
  • 3 篇 friggstad zachar...
  • 3 篇 liu jun
  • 3 篇 li chung-lun
  • 3 篇 liu xi
  • 3 篇 ogorodnikov yuri
  • 3 篇 li guojun
  • 3 篇 huang xiuzhen
  • 3 篇 jansen klaus
  • 3 篇 salavatipour moh...
  • 3 篇 wu weili
  • 2 篇 zhang xuejie
  • 2 篇 kim donghyun
  • 2 篇 zhang zhao

语言

  • 68 篇 英文
  • 8 篇 其他
检索条件"主题词=Polynomial Time Approximation Scheme"
76 条 记 录,以下是71-80 订阅
排序:
Bag-of-Tasks Scheduling with Rejection in Large Computing Systems
收藏 引用
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH 2023年 第4期40卷 2340011-2340011页
作者: Li, Weidong Yunnan Univ Sch Math & Stat Kunming 650504 Peoples R China
We are given a set of m identical parallel machines and a set of n jobs in large computing systems, where each job J(j) consists of a bag of bj identical tasks with a processing time p(j), and has a rejection penalty ... 详细信息
来源: 评论
The Two-Edge Connectivity Survivable-Network Design Problem in Planar Graphs
收藏 引用
ACM TRANSACTIONS ON ALGORITHMS 2016年 第3期12卷 30-30页
作者: Borradaile, Glencora Klein, Philip Oregon State Univ Sch Elect Engn & Comp Sci Corvallis OR 97331 USA Brown Univ Dept Comp Sci Providence RI 02912 USA
Consider the following problem: given a graph with edge costs and a subset Q of vertices, find a minimum-cost subgraph in which there are two edge-disjoint paths connecting every pair of vertices in Q. The problem is ... 详细信息
来源: 评论
Truthful mechanism for joint resource allocation and task offloading in mobile edge computing
收藏 引用
COMPUTER NETWORKS 2024年 254卷
作者: Liu, Xi Liu, Jun Li, Weidong Qujing Normal Univ Sch Informat Engn Key Lab Intelligent Sensor & Syst Design Qujing Yunnan Peoples R China Qujing Normal Univ Engn Res Ctr Intelligent Syst & Adv Mat Yunnan Pro Qujing Yunnan Peoples R China Yunnan Coll Business Management Sch Educ Kunming Yunnan Peoples R China Yunnan Univ Sch Math & Stat Kunming Yunnan Peoples R China
In the context of mobile edge computing (MEC), the delay-sensitive tasks can achieve real-time data processing and analysis by offloading to the MEC servers. The objective is maximizing social welfare in an auction- b... 详细信息
来源: 评论
Some Discussions on Parallel Bounded Batch Scheduling to Minimize the Sum of Squared Machine Loads
收藏 引用
Journal of Mathematics and System Science 2016年 第2期6卷 60-65页
作者: Zengxia Cai Xianzhao Zhang College of Science Linyi University Linyi 276005 PR China.
We sttidy the problem of scheduling n jobs on m parallel bounded batch machines to minimize the sum of squared machine loads. Each batch contains at most B jobs, and the processing time of a batch is equal to the long... 详细信息
来源: 评论
Improved predicting algorithm of RNA pseudoknotted structure
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTATIONAL SCIENCE AND ENGINEERING 2019年 第1期19卷 64-70页
作者: Liu, Zhendong Zhu, Daming Dai, Qionghai Shandong Jianzhu Univ Sch Comp Sci & Technol Jinan 250101 Shandong Peoples R China Tsinghua Univ Dept Automat Beijing 100084 Peoples R China
The prediction of RNA structure with pseudoknots is NP-hard problem. According to minimum free energy models and computational methods, we investigate the RNA pseudoknotted structures and their characteristics. The pa... 详细信息
来源: 评论
A PTAS for Scheduling Unrelated Machines of Few Different Types
收藏 引用
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2018年 第4期29卷 591-621页
作者: Gehrke, Jan Clemens Jansen, Klaus Kraft, Stefan E. J. Univ Kiel Dept Comp Sci Algorithms & Complex D-24098 Kiel Germany TNC Technol Consulting GmbH Betastr 13a D-85774 Unterfohring Germany
Scheduling on Unrelated Machines is a classical optimization problem where n jobs have to be distributed to m machines. Each of the jobs j is an element of {1,...,n} has on machine i is an element of{ 1,...,m} a proce... 详细信息
来源: 评论