Evaluating Search Methods Analytically

A unified approach to analyzing search algorithms is presented. Each algorithm is characterized by the types of random problems that it can solve rapidly. The results are displayed in a way that clearly indicates the strengths and weaknesses of each algorithm.

[1]  Paul Walton Purdom,et al.  An Average Time Analysis of Backtracking , 1981, SIAM J. Comput..

[2]  Paul Walton Purdom,et al.  Average Time Analyses of Simplified Davis-Putnam Procedures , 1982, Inf. Process. Lett..

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

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

[5]  R M Haralick,et al.  The consistent labeling problem: part I. , 1979, IEEE transactions on pattern analysis and machine intelligence.

[6]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[7]  Paul Walton Purdom,et al.  An Analysis of Backtracking with Search Rearrangement , 1983, SIAM J. Comput..

[8]  E. T. Parker.  Computer investigation of orthogonal Latin squares of order ten , 1963 .

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

[10]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

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

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

[13]  John Franco,et al.  Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem , 1983, Discret. Appl. Math..

[14]  Paul W. Purdom,et al.  Solving Satisfiability with Less Searching , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  Edward M. Reingold,et al.  Backtrack programming techniques , 1975, CACM.