2714 search results - page 64 / 543 » Approximation Schemes for Scheduling |
DAC
1997
ACM
15 years 4 months ago
1997
ACM
Task scheduling forreactive real time systems is a di cult problem due to tight constraints that the schedule must satisfy. A static priority scheme is proposed here that can be f...
83
Voted
WIOPT
2010
IEEE
14 years 11 months ago
2010
IEEE
—Self-organizing networks (SON) is commonly seen as a way to increase network performance while simplifying its management. This paper investigates Packet Scheduling (PS) in the ...
104
Voted
SIAMNUM
2010
14 years 7 months ago
2010
Abstract. It is shown that for a broad class of equations that numerical solutions computed using the discontinuous Galerkin or the continuous Galerkin time stepping schemes of arb...
129
Voted
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
92
Voted
CORR
2010
Springer
15 years 18 days ago
2010
Springer
One of the classic results in scheduling theory is the 2-approximation algorithm by Lenstra, Shmoys, and Tardos for the problem of scheduling jobs to minimize makespan on unrelate...