Evaluating Search Methods Analytically

Paul W. Purdom, Jr., Cynthia A. Brown

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.


This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.