Generating Admissible Heuristics by Criticizing Solutions to Relaxed Models
暂无分享,去创建一个
[1] Richard E. Korf,et al. Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..
[2] Rina Dechter,et al. The Anatomy of Easy Problems: A Constraint-Satisfaction Formulation , 1985, IJCAI.
[3] Judea Pearl,et al. Heuristics : intelligent search strategies for computer problem solving , 1984 .
[4] John R. Anderson,et al. MACHINE LEARNING An Artificial Intelligence Approach , 2009 .
[5] Marco Valtorta,et al. A Result on the Computational Complexity of Heuristic Estimates for the A* Algorithm , 1983, IJCAI.
[6] Larry A. Rendell,et al. A New Basis for State-Space Learning Systems and a Successful Implementation , 1983, Artif. Intell..
[7] Douglas B. Lenat,et al. EURISKO: A Program That Learns New Heuristics and Domain Concepts , 1983, Artif. Intell..
[8] Douglas B. Lenat,et al. Theory Formation by Heuristic Search , 1983, Artificial Intelligence.
[9] Robert E. Tarjan,et al. Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.
[10] R. Korf. Learning to solve problems by searching for macro-operators , 1983 .
[11] Douglas B. Lenat,et al. The Nature of Heuristics , 1982, Artif. Intell..
[12] Nils J. Nilsson,et al. Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[13] Richard E. Korf,et al. Toward a Model of Representation Changes , 1980, Artif. Intell..
[14] John Gaschnig,et al. A Problem Similarity Approach to Devising Heuristics: First Results , 1979, IJCAI.
[15] Giovanni Guida,et al. A Method for Computing Heuristics in Problem-Solving , 1978, AISB/GI.
[16] Ellis Horowitz,et al. Fundamentals of Computer Algorithms , 1978 .
[17] Gerald Jay Sussman,et al. A Computer Model of Skill Acquisition , 1975 .
[18] Richard M. Wilson,et al. Graph puzzles, homotopy, and the alternating group☆ , 1974 .
[19] Nils J. Nilsson,et al. Artificial Intelligence , 1974, IFIP Congress.
[20] Earl D. Sacerdoti,et al. Planning in a Hierarchy of Abstraction Spaces , 1974, IJCAI.
[21] Ira Pohl,et al. The Avoidance of (Relative) Catastrophe, Heuristic Competence, Genuine Dynamic Weighting and Computational Issues in Heuristic Problem Solving , 1973, IJCAI.
[22] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[23] Allen Newell,et al. Human Problem Solving. , 1973 .
[24] Richard Fikes,et al. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.
[25] Richard M. Karp,et al. The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..
[26] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[27] George L. Nemhauser,et al. The Traveling Salesman Problem: A Survey , 1968, Oper. Res..
[28] S. Lavrov,et al. Machine intelligence. I: Edited by N. L. Collins, D. Michie. Oliver and Boyd, x + 278 pp., Edinburgh-London, 1967☆ , 1968 .
[29] Arthur L. Samuel,et al. Some Studies in Machine Learning Using the Game of Checkers , 1967, IBM J. Res. Dev..
[30] Martin Gardner,et al. Mathematical puzzles of Sam Loyd , 1959 .
[31] G. Croes. A Method for Solving Traveling-Salesman Problems , 1958 .
[32] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .
[33] William J. Cook,et al. Solution of a Large-Scale Traveling-Salesman Problem , 1954, 50 Years of Integer Programming.
[34] Tait. 2. Note on the Theory of the “15 Puzzle”. , 1880 .
[35] W. W. Johnson,et al. Notes on the "15" Puzzle , 1879 .