咨询与建议

限定检索结果

文献类型

  • 1 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 1 篇 工学
    • 1 篇 电气工程
    • 1 篇 计算机科学与技术...

主题

  • 1 篇 task demand
  • 1 篇 bounded preceden...
  • 1 篇 adaptive variabl...
  • 1 篇 fully polynomial...

机构

  • 1 篇 state univ arlin...
  • 1 篇 wayne state univ...
  • 1 篇 virginia polytec...

作者

  • 1 篇 chantem thidapat...
  • 1 篇 willcock aaron
  • 1 篇 fisher nathan

语言

  • 1 篇 英文
检索条件"主题词=bounded precedence constraint knapsack problem"
1 条 记 录,以下是1-10 订阅
排序:
A Fully Polynomial Time Approximation Scheme for Adaptive Variable Rate Task Demand  24
A Fully Polynomial Time Approximation Scheme for Adaptive Va...
收藏 引用
32nd International Conference on Real-Time Networks and Systems
作者: Willcock, Aaron Fisher, Nathan Chantem, Thidapat (Tam) Wayne State Univ Detroit MI 48202 USA Virginia Polytech Inst & State Univ Arlington VA USA State Univ Arlington Arlington VA USA
The Adaptive Variable Rate (AVR) task model defines a task where job WCET and period are a function of engine speed. Motivated by a lack of tractable AVR task demand methods, this work uses predefined job sequences fo... 详细信息
来源: 评论