517 search results - page 21 / 104 » Approximation Algorithms for Scheduling with Reservations |
130
Voted
AAAI
2007
15 years 5 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...
149
Voted
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
106
Voted
CP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The sub-optimality approximation problem considers an optimization problem O, its optimal solution σ∗ , and a variable x with domain {d1, . . . , dm} and returns appro...
113
Voted
CEE
2007
15 years 3 months ago
2007
Real-time systems are often designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an i...
113
Voted
ICDCS
1999
IEEE
15 years 7 months ago
1999
IEEE
We describe imprecise calendars, a way to organize and schedule clusters of nodes in a computation grid. Imprecise calendars permit the easy and efficient sharing of resources bet...