206 search results - page 9 / 42 » Better Bounds for Online Scheduling |
SWAT
2004
Springer
14 years 27 days ago
2004
Springer
We consider online scheduling of splittable tasks on parallel machines. In our model, each task can be split into a limited number of parts, that can then be scheduled independentl...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet...
AAAI
2007
13 years 10 months ago
2007
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
ISAAC
2001
Springer
13 years 12 months ago
2001
Springer
In current networks, packet losses can occur if routers do not provide sufficiently large buffers. This paper studies how many buffers should be provided in a router to eliminat...
AAAI
2007
13 years 10 months ago
2007
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...