Istituto di Scienza e Tecnologie dell'Informazione     
Martelli A. Some remarks on the complexity of heuristic search algorithms. In: Proceedings International Computing Symposium 1975 (Antibes, 1975). Proceedings, pp. 69 - 76. 1975.
This paper analyzes the complexity of heuristic search algorithms, i.e. algorithms which find the shortest path in a graph by using a heuristic function to guide the search.

Icona documento 1) Download Document PDF

Icona documento Open access Icona documento Restricted Icona documento Private


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional