Evaluating Search Methods Analytically
Abstract
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 indicabes the strengths and weaknesses of each algorithm. Many interesting problems can, at present, best be solved by search methods [7]. In the worst case, searching requires exponent ial time. Several clever techniques have been developed to speed up searching (see, for example, 11, 3,
Cite
Text
Jr. and Brown. "Evaluating Search Methods Analytically." AAAI Conference on Artificial Intelligence, 1982.Markdown
[Jr. and Brown. "Evaluating Search Methods Analytically." AAAI Conference on Artificial Intelligence, 1982.](https://mlanthology.org/aaai/1982/jr1982aaai-evaluating/)BibTeX
@inproceedings{jr1982aaai-evaluating,
title = {{Evaluating Search Methods Analytically}},
author = {Jr., Paul Walton Purdom and Brown, Cynthia A.},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1982},
pages = {124-127},
url = {https://mlanthology.org/aaai/1982/jr1982aaai-evaluating/}
}