Artificial Intelligence, Volume 129

Volume 129, Number 1-2, June 2001

• Weixiong Zhang, Rina Dechter, Richard E. Korf:
  Heuristic search in artificial intelligence. 1-4
  Electronic Edition (link) BibTeX
• Blai Bonet, Hector Geffner:
  Planning as heuristic search. 5-33
  Electronic Edition (link) BibTeX
• Eric A. Hansen, Shlomo Zilberstein:
  LAO^*: A heuristic search algorithm that finds solutions with loops. 35-62
  Electronic Edition (link) BibTeX
• Louis I. Steinberg:
  Searching stochastically generated multi-abstraction-level design spaces. 63-90
  Electronic Edition (link) BibTeX
• Kalev Kask, Rina Dechter:
  A general scheme for automatic generation of search heuristics from specification dependencies. 91-131
  Electronic Edition (link) BibTeX
• Pedro Meseguer, Carme Torras:
  Exploiting symmetries within constraint satisfaction search. 133-163
  Electronic Edition (link) BibTeX
• Sven Koenig:
  Minimax real-time heuristic search. 165-197
  Electronic Edition (link) BibTeX
• Richard E. Korf, Michael Reid, Stefan Edelkamp:
  Time complexity of iterative-deepening-A^*. 199-218
  Electronic Edition (link) BibTeX
• Andreas Junghanns, Jonathan Schaeffer:
  Sokoban: Enhancing general single-agent search methods using domain knowledge. 219-251
  Electronic Edition (link) BibTeX
• Masahiro Seo, Hiroyuki Iida, Jos W. H. M. Uiterwijk:
  The PN^*-search algorithm: Application to tsume-shogi. 253-277
  Electronic Edition (link) BibTeX
• Martin Müller:
  Partial order bounding: A new approach to evaluation in game tree search. 279-311
  Electronic Edition (link) BibTeX