论文信息 - Depth-First Iterative-Deepening: An Optimal Admissible Tree Search - 字舞流文

Depth-First Iterative-Deepening: An Optimal Admissible Tree Search

Richard E. Korf | R. Korf

[1] E. KorfRichard. Depth-first iterative-deepening: an optimal admissible tree search , 1985 .

[2] Richard E. Korf,et al. Iterative-Deepening-A*: An Optimal Admissible Tree Search , 1985, IJCAI.

[3] László Méro,et al. A Heuristic Search Algorithm with Modifiable Estimate , 1984, Artif. Intell..

[4] Berliner,et al. A quantitative study of search methods and the effect of constraint satisfaction , 1984 .

[5] Rina Dechter,et al. The Optimality of A* Revisited , 1983, AAAI.

[6] R. Korf. Learning to solve problems by searching for macro-operators , 1983 .

[7] Nils J. Nilsson,et al. Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8] 守屋悦朗,et al. J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[9] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[10] Allen Newell,et al. Human Problem Solving. , 1973 .

[11] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..