Sciweavers

849 search results - page 31 / 170
» The Early Restart Algorithm
Sort
View
111
Voted
EVOW
2007
Springer
15 years 8 months ago
Iterated k-Opt Local Search for the Maximum Clique Problem
Abstract. This paper presents a simple iterated local search metaheuristic incorporating a k-opt local search (KLS), called Iterated KLS (IKLS for short), for solving the maximum c...
Kengo Katayama, Masashi Sadamatsu, Hiroyuki Narihi...
PPSN
1998
Springer
15 years 6 months ago
The Traveling Salesrep Problem, Edge Assembly Crossover, and 2-opt
Optimal results for the Traveling Salesrep Problem have been reported on problems with up to 3038 cities using a GA with Edge Assembly Crossover EAX. This paper rst attempts to ind...
Jean-Paul Watson, Charlie Ross, V. Eisele, J. Dent...
ECAI
2010
Springer
15 years 3 months ago
Nested Monte-Carlo Expression Discovery
Nested Monte-Carlo search is a general algorithm that gives good results in single player games. Genetic Programming evaluates and combines trees to discover expressions that maxim...
Tristan Cazenave
97
Voted
IJCAI
2003
15 years 3 months ago
Corpus-based, Statistical Goal Recognition
Goal recognition for dialogue systems needs to be fast, make early predictions, and be portable. We present initial work which shows that using statistical, corpus-based methods t...
Nate Blaylock, James F. Allen
PRICAI
2004
Springer
15 years 7 months ago
Solving Over-Constrained Temporal Reasoning Problems Using Local Search
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
Matthew Beaumont, John Thornton, Abdul Sattar, Mic...