@inproceedings{Gooley1990SpeculativeSA, title={Speculative search: An efficient search algorithm for limited memory}, author={Markian M. Gooley and Benjamin W. Wah}, booktitle={TAI}, year={1990} }

- Published 1990 in TAI
DOI:10.1109/TAI.1990.130333

Solving a problem optimally using an A' search minimizes the number of nodes expanded. In the worst case, however, it uses an amount of memory exponential in the size of the problem. More general forms of best-first search have the same problem. Depth-first search uses a linear amount of storage, but expands more nodes on the average than bcst-first… CONTINUE READING

### Presentations referencing similar topics