The SCEAS System
Navigation Menu

Journals in DBLP

Artif. Intell.
2001, volume: 129, number: 1-2

  1. Weixiong Zhang, Rina Dechter, Richard E. Korf
    Heuristic search in artificial intelligence. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2001, v:129, n:1-2, pp:1-4 [Journal]
  2. Blai Bonet, Hector Geffner
    Planning as heuristic search. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2001, v:129, n:1-2, pp:5-33 [Journal]
  3. Eric A. Hansen, Shlomo Zilberstein
    LAO*: A heuristic search algorithm that finds solutions with loops. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2001, v:129, n:1-2, pp:35-62 [Journal]
  4. Louis I. Steinberg
    Searching stochastically generated multi-abstraction-level design spaces. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2001, v:129, n:1-2, pp:63-90 [Journal]
  5. Kalev Kask, Rina Dechter
    A general scheme for automatic generation of search heuristics from specification dependencies. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2001, v:129, n:1-2, pp:91-131 [Journal]
  6. Pedro Meseguer, Carme Torras
    Exploiting symmetries within constraint satisfaction search. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2001, v:129, n:1-2, pp:133-163 [Journal]
  7. Sven Koenig
    Minimax real-time heuristic search. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2001, v:129, n:1-2, pp:165-197 [Journal]
  8. Richard E. Korf, Michael Reid, Stefan Edelkamp
    Time complexity of iterative-deepening-A*. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2001, v:129, n:1-2, pp:199-218 [Journal]
  9. Andreas Junghanns, Jonathan Schaeffer
    Sokoban: Enhancing general single-agent search methods using domain knowledge. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2001, v:129, n:1-2, pp:219-251 [Journal]
  10. Masahiro Seo, Hiroyuki Iida, Jos W. H. M. Uiterwijk
    The PN*-search algorithm: Application to tsume-shogi. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2001, v:129, n:1-2, pp:253-277 [Journal]
  11. Martin Müller 0003
    Partial order bounding: A new approach to evaluation in game tree search. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2001, v:129, n:1-2, pp:279-311 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002