874 search results - page 35 / 175 » Optimal Scheduling of Contract Algorithms for Anytime Proble... |
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
An anytime algorithm is capable of returning a response to the given task at essentially any time; typically the quality of the response improves as the time increases. Here, we c...
105
click to vote
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
MFCS
2004
Springer
15 years 3 months ago
2004
Springer
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
CP
1997
Springer
15 years 1 months ago
1997
Springer
A number of pitfalls of empirical scheduling research are illustrated using real experimental data. These pitfalls, in general, serve to slow the progress of scheduling research b...
CLUSTER
2008
IEEE
15 years 4 months ago
2008
IEEE
—Divisible load model allows scheduling algorithms that give nearly optimal makespan with practical computational complexity. Beaumont et al. have shown that their algorithm prod...