Complexity Analysis of Admissible Heuristic Search
暂无分享,去创建一个
[1] Richard E. Korf,et al. Finding Optimal Solutions to Rubik's Cube Using Pattern Databases , 1997, AAAI/IAAI.
[2] Jonathan Schaeffer,et al. Searching with Pattern Databases , 1996, Canadian Conference on AI.
[3] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[4] Richard E. Korf,et al. Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..
[5] Richard E. Korf,et al. The Branching Factor of Regular Search Spaces , 1998, AAAI/IAAI.
[6] László Méro,et al. A Heuristic Search Algorithm with Modifiable Estimate , 1984, Artif. Intell..
[7] J. Gaschnig. Performance measurement and analysis of certain search algorithms. , 1979 .