874 search results - page 7 / 175 » Optimal Scheduling of Contract Algorithms for Anytime Proble... |
AAAI
2007
15 years 2 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...
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
109
click to vote
MST
2008
14 years 11 months ago
2008
We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider ...
TASE
2008
IEEE
14 years 11 months ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
COR
2006
14 years 12 months ago
2006
Over the last decade and a half, tabu search algorithms for machine scheduling have gained a near-mythical reputation by consistently equaling or establishing state-of-the-art per...