𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A result on the computational complexity of heuristic estimates for the A∗ algorithm

✍ Scribed by Marco Valtorta


Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
739 KB
Volume
34
Category
Article
ISSN
0020-0255

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


A new result on the complexity of heuris
✍ Othar Hansson; Andrew Mayer; Marco Valtorta 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 736 KB

Hansson, O., A. Mayer and M. Valtorta, A new result on the complexity of heuristic estimates for the A \* algorithm, Artificial Intelligence 55 (1992) 129-143. Relaxed models are abstract problem descriptions generated by ignoring constraints that are present in base-level problems. They play an im