Volume 129, Number 1-2, June 2001
- Weixiong Zhang, Rina Dechter, Richard E. Korf:
Heuristic search in artificial intelligence.
1-4
- Blai Bonet, Hector Geffner:
Planning as heuristic search.
5-33
- Eric A. Hansen, Shlomo Zilberstein:
LAO*: A heuristic search algorithm that finds solutions with loops.
35-62
- Louis I. Steinberg:
Searching stochastically generated multi-abstraction-level design spaces.
63-90
- Kalev Kask, Rina Dechter:
A general scheme for automatic generation of search heuristics from specification dependencies.
91-131
- Pedro Meseguer, Carme Torras:
Exploiting symmetries within constraint satisfaction search.
133-163
- Sven Koenig:
Minimax real-time heuristic search.
165-197
- Richard E. Korf, Michael Reid, Stefan Edelkamp:
Time complexity of iterative-deepening-A*.
199-218
- Andreas Junghanns, Jonathan Schaeffer:
Sokoban: Enhancing general single-agent search methods using domain knowledge.
219-251
- Masahiro Seo, Hiroyuki Iida, Jos W. H. M. Uiterwijk:
The PN*-search algorithm: Application to tsume-shogi.
253-277
- Martin Müller:
Partial order bounding: A new approach to evaluation in game tree search.
279-311
Last update Sun May 19 23:47:26 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
