1171 search results - page 48 / 235 » Variable neighborhood search |
169
click to vote
AAAI
1996
15 years 7 months ago
1996
This paper compares three commitment strategies for HTN planning: (1) a strategy that delays variable bindings as much as possible; (2) a strategy in which no non-primitive task i...
161
click to vote
EJC
2008
15 years 6 months ago
2008
1 Rational functions and minimal factorizations of permutations Let f : C C be a rational function of degree n in one complex variable. A critical point of f is a point z C such...
147
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
In this work we provide empirical evidence that shows how a variable-length genetic algorithm (GA) can naturally evolve shorter average size populations. This reduction in chromos...
151
click to vote
SAT
2005
Springer
15 years 11 months ago
2005
Springer
Many current local search algorithms for SAT fall into one of two classes. Random walk algorithms such as Walksat/SKC, Novelty+ and HWSAT are very successful but can be trapped for...
173
click to vote
AAAI
1998
15 years 7 months ago
1998
In this paper, we describe methods for e ciently computing better solutions to control problems in continuous state spaces. We provide algorithms that exploit online search to boo...