34 search results - page 4 / 7 » Online Interval Scheduling: Randomized and Multiprocessor Ca... |
STACS
2004
Springer
14 years 13 days ago
2004
Springer
We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an ...
IPPS
2000
IEEE
13 years 11 months ago
2000
IEEE
In this paper, we study the problem of on demand minimum length packet scheduling in single-hop multichannel systems. Examples of these systems are those centered around switching...
SIAMDM
2002
13 years 6 months ago
2002
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
CLUSTER
2002
IEEE
13 years 7 months ago
2002
IEEE
Abstract. We describe and evaluate the Running Time Advisor (RTA), a system that can predict the running time of a compute-bound task on a typical shared, unreserved commodity host...
AAAI
2007
13 years 9 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...