617 search results - page 16 / 124 » Local Search for Heuristic Guidance in Tree Search |
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
This paper proposes a novel application of differential evolution to solve a difficult dynamic optimisation or optimal control problem. The miss distance in a missile-target engag...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Simulated annealing and the (1+1) EA, a simple evolutionary algorithm, are both general randomized search heuristics that optimize any objective function with probability
ICTAI
2009
IEEE
14 years 7 months ago
2009
IEEE
We propose a framework which we call stochastic offline programming (SOP). The idea is to embed the development of combinatorial algorithms in an off-line learning environment whi...
SARA
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to...
DAC
1999
ACM
15 years 10 months ago
1999
ACM
