200 search results - page 11 / 40 » Approximation Algorithms for Scheduling on Multiple Machines |
DCOSS
2006
Springer
13 years 11 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...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we consider the mechanism design version of the fractional variant of the scheduling problem on unrelated machines. We give a lower bound of 2 − 1/n for any fracti...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
ML
2002
ACM
13 years 7 months ago
2002
ACM
TD() is a popular family of algorithms for approximate policy evaluation in large MDPs. TD() works by incrementally updating the value function after each observed transition. It h...