Sciweavers

1614 search results - page 43 / 323
» Breadth-First Heuristic Search
Sort
View
CI
1998
78views more  CI 1998»
13 years 9 months ago
Pattern Databases
A pattern database is a lookup table that stores an exact evaluation function for a relaxed search problem, which provides an admissible heuristic for the original search problem....
Joseph C. Culberson, Jonathan Schaeffer
AAAI
2008
14 years 10 days ago
How Good is Almost Perfect?
Heuristic search using algorithms such as A and IDA is the prevalent method for obtaining optimal sequential solutions for classical planning tasks. Theoretical analyses of these ...
Malte Helmert, Gabriele Röger
AIPS
2000
13 years 11 months ago
Admissible Heuristics for Optimal Planning
hsp and hspr are two recent planners that search the state-space using an heuristic function extracted from Strips encodings. hsp does a forward search from the initial state reco...
Patrik Haslum, Hector Geffner
GECCO
2004
Springer
119views Optimization» more  GECCO 2004»
14 years 3 months ago
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
Frank Neumann, Ingo Wegener
AAAI
2006
13 years 11 months ago
Disco - Novo - GoGo: Integrating Local Search and Complete Search with Restarts
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, ...
Meinolf Sellmann, Carlos Ansótegui