1800 search results - page 5 / 360 » Learning Restart Strategies |
IJCAI
2007
13 years 9 months ago
2007
AAAI
2006
13 years 9 months ago
2006
A hybrid algorithm is devised to boost the performance of complete search on under-constrained problems. We suggest to use random variable selection in combination with restarts, ...
JSSPP
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we examine the concept of giving every job a trial run before committing it to run until completion. Trial runs allow immediate job failures to be detected shortly a...
ILP
2004
Springer
14 years 26 days ago
2004
Springer
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
GECCO
2009
Springer
14 years 3 days ago
2009
Springer
We propose a multistart CMA-ES with equal budgets for two interlaced restart strategies, one with an increasing population size and one with varying small population sizes. This B...