517 search results - page 9 / 104 » Approximation Algorithms for Scheduling with Reservations |
90
Voted
RTCSA
2005
IEEE
15 years 5 months ago
2005
IEEE
Abstract— Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible...
EUROPAR
2010
Springer
14 years 11 months ago
2010
Springer
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
86
Voted
SIAMCOMP
2010
14 years 6 months ago
2010
Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...
79
Voted
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
—Abstract—In recent years, numerous large-scale Wireless LANs (WLAN) have been deployed all over the world. However, the shortage of non-interfering channels makes it a challen...
104
click to vote
DCOSS
2006
Springer
15 years 3 months ago
2006
Springer
We develop algorithms for finding the minimum energy transmission schedule for duty-cycle and rate constrained wireless sensor nodes transmitting over an interference channel. Sinc...