Prediction of regular search tree growth by spectral analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2174, Issue , 2001, Pages 154-168

  Edelkamp, Stefan ^a  

^a Institut fur Informatik   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FORECASTING; FORESTRY; SPECTRUM ANALYSIS; TREES (MATHEMATICS);

BRANCHING FACTORS; BRUTE FORCE SEARCH; CLOSED FORM; EQUILIBRIUM DISTRIBUTIONS; RANDOM SAMPLING; SEARCH TREES; SPECTRAL RADII; TIME COMPLEXITY ANALYSIS;

ARTIFICIAL INTELLIGENCE;

EID: 84882048007     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45422-5_12     Document Type: Conference Paper

References (15)

1. J. C. Culberson. Sokoban is PSPACE-complete. In Fun for Algorithms (FUN), pages 65-76. Carleton Scientific, 1998.
2. S. Edelkamp and R. E. Korf. The branching factor of regular search spaces. In National Conference on Artificial Intelligence (AAAI), 1998. 299-304.
3. S. Edelkamp, A. L. Lafuente, and S. Leue. Protocol verification with heuristic search. In AAAI-Spring Symposium on Model-based Validation of Intelligence, pages 75-83, 2001.
4. S. Edelkamp and U. Meyer. Theory and practice of time-space trade-offs in memory limited search. This volume.
5. P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for heuristicdetermination of minimum path cost. IEEE Transaction on SSC, 4:100-107, 1968.
6. M. Holzer and S. Schwoon. Assembling molecules in Atomix is hard. Technical Report 0101, Institut für Informatik, Technische Universität München, 2001.
7. F. Hüffner, S. Edelkamp, H. Fernau, and R. Niedermeier. Finding optimal solutions to Atomix. This volume.
8. A. Junghanns. Pushing the Limits: New Developments in Single-Agent Search. PhD thesis, University of Alberta, 1999.
9. R. E. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1):97-109, 1985.
10. R. E. Korf. Linear-space best-first search. Artificial Intelligence, 62(1):41-78, 1993.
11. R. E. Korf. Finding optimal solutions to Rubik’s Cube using pattern databases. In National Conference on Artificial Intelligence (AAAI), pages 700-705, 1997.
12. R. E. Korf and A. Felner. Disjoint pattern database heuristics. Artificial Intelligence, 2001. To appear.
13. R. E. Korf and M. Reid. Complexity analysis of admissible heuristicsearc h. In National Conference on Artificial Intelligence (AAAI), 1998. 305-310.
14. R. E. Korf, M. Reid, and S. Edelkamp. Time complexity of Iterative-Deepening-A*. Artificial Intelligence, 2001. To appear.
15. R. E. Korf and L. A. Taylor. Finding optimal solutions to the twenty-four puzzle. In National Conference on Artificial Intelligence (AAAI), pages 1202-1207, 1996.