187 search results - page 9 / 38 » Approximation Algorithms for Multiprocessor Scheduling under... |
DAC
2010
ACM
13 years 11 months ago
2010
ACM
With the ever-increasing transistor variability in CMOS technology, it is essential to integrate variation-aware performance analysis into the task allocation and scheduling proce...
RTSS
2007
IEEE
14 years 1 months ago
2007
IEEE
We consider the issue of deadline tardiness under global multiprocessor scheduling algorithms. We present a general tardiness-bound derivation that is applicable to a wide variety...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
TRANSCI
2010
13 years 2 months ago
2010
We consider the Courier Delivery Problem, a variant of the Vehicle Routing Problem with time windows in which customers appear probabilistically and their service times are uncert...
SPAA
2003
ACM
14 years 27 days ago
2003
ACM
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty proce...