Search: A survey of recent results

[1]  Allen Newell,et al.  GPS, a program that simulates human thought , 1995 .

[2]  Richard E. Korf,et al.  Distributed Tree Search and Its Application to Alpha-Beta Pruning , 1988, AAAI.

[3]  David J. Slate,et al.  Chess 4.5-The Northwestern University chess program , 1988 .

[4]  Rina Dechter,et al.  Network-Based Heuristics for Constraint-Satisfaction Problems , 1987, Artif. Intell..

[5]  Ronald L. Rivest,et al.  Game Tree Searching by Min/Max Approximation , 1987, Artif. Intell..

[6]  Richard E. Korf,et al.  Planning as Search: A Quantitative Approach , 1987, Artif. Intell..

[7]  Allen Newell,et al.  SOAR: An Architecture for General Intelligence , 1987, Artif. Intell..

[8]  Vipin Kumar,et al.  A Parallel Implementation of Iterative-Deepening-A* , 1987, AAAI.

[9]  Richard E. Korf,et al.  A Model of Two-Player Evaluation Functions , 1987, AAAI.

[10]  Udi Manber,et al.  DIB—a distributed implementation of backtracking , 1987, TOPL.

[11]  Manfred K. Warmuth,et al.  Finding a Shortest Solution for the N × N Extension of the 15-PUZZLE Is Intractable , 1986, AAAI.

[12]  Richard E. Korf,et al.  A Unified Theory of Heuristic Evaluation Functions and its Application to Learning , 1986, AAAI.

[13]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

[14]  Mabry Tyson,et al.  An Analysis of Consecutively Bounded Depth-First Search with Applications in Automated Deduction , 1985, IJCAI.

[15]  Dana S. Nau,et al.  An Evaluation of Two Alternatives to Minimax , 1985, UAI.

[16]  Rina Dechter,et al.  Generalized best-first search strategies and the optimality of A* , 1985, JACM.

[17]  Richard E. Korf,et al.  Macro-Operators: A Weak Method for Learning , 1985, Artif. Intell..

[18]  Paul Walton Purdom,et al.  Search Rearrangement Backtracking and Polynomial Average Time , 1983, Artif. Intell..

[19]  Judea Pearl,et al.  On the Nature of Pathology in Game Searching , 1983, Artif. Intell..

[20]  Dana S. Nau,et al.  An Investigation of the Causes of Pathology in Games , 1982, Artif. Intell..

[21]  Paul S. Rosenbloom,et al.  A World-Championship-Level Othello Program , 1982, Artif. Intell..

[22]  John P. Fishburn,et al.  Parallelism in Alpha-Beta Search , 1982, Artif. Intell..

[23]  Judea Pearl,et al.  The solution for the branching factor of the alpha-beta pruning algorithm and its optimality , 1982, CACM.

[24]  K. Thompson,et al.  BELLE CHESS HARDWARE , 1982 .

[25]  Eugene C. Freuder.  A Sufficient Condition for Backtrack-Free Search , 1982, JACM.

[26]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[27]  J. Gaschnig.  Performance measurement and analysis of certain search algorithms. , 1979 .

[28]  Gerard Maurice Baudet,et al.  The design and analysis of algorithms for asynchronous multiprocessors. , 1978 .

[29]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[30]  Donald E. Knuth,et al.  The Solution for the Branching Factor of the Alpha-Beta Pruning Algorithm , 1981, ICALP.

[31]  Herbert A. Simon,et al.  Optimal Problem-Solving Search: All-Oor-None Solutions , 1975, Artif. Intell..

[32]  David L. Waltz,et al.  Understanding Line drawings of Scenes with Shadows , 1975 .

[33]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[34]  Earl D. Sacerdoti,et al.  Planning in a Hierarchy of Abstraction Spaces , 1974, IJCAI.

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

[36]  James R. Slagle,et al.  A Heuristic Program that Solves Symbolic Integration Problems in Freshman Calculus , 1963, JACM.

[37]  Fred M. Tonge,et al.  Summary of a Heuristic Line Balancing Procedure , 1960 .

[38]  H. Gelernter,et al.  Realization of a geometry theorem proving machine , 1995, IFIP Congress.

[39]  Arthur L. Samuel,et al.  Some Studies in Machine Learning Using the Game of Checkers , 1967, IBM J. Res. Dev..

[40]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[41]  A. M. Turing,et al.  Computing Machinery and Intelligence , 1950, The Philosophy of Artificial Intelligence.

[42]  Claude E. Shannon,et al.  XXII. Programming a Computer for Playing Chess 1 , 1950 .

[43]  Claude E. Shannon,et al.  Programming a computer for playing chess , 1950 .