The B* tree search algorithm: A best-first proof procedure

Berliner, H. J.

Classics/files/AI/classics/Webber-Nilsson-Readings/Rdgs-NW-Berliner.pdf 

Searches are conducted whenever selection cannot be done effectively by computing a function of some state description of the competing alternatives.

Similar Docs  Excel Report  more

TitleSimilaritySource
None found