706 search results - page 64 / 142 » Online Interval Scheduling |
EUC
2004
Springer
14 years 1 months ago
2004
Springer
We propose power-aware on-line task scheduling algorithms for mixed task sets which consist of both periodic and aperiodic tasks. The proposed algorithms utilize the execution beha...
DATE
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper presents two fully polynomial-time sufficient feasibility tests for EDF when considering periodic tasks with arbitrary deadlines and preemptive scheduling on uniproces...
COCO
2005
Springer
14 years 1 months ago
2005
Springer
We propose a model called priority branching trees (pBT ) for backtracking and dynamic programming algorithms. Our model generalizes both the priority model of Borodin, Nielson an...
JACM
2006
13 years 7 months ago
2006
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
ATMN
1996
13 years 9 months ago
1996
In this work, the problem of scheduling packets with a group as opposed to an individual deadline is considered. Packets of the same group are supposed to belong in the same appli...