New approaches for understanding the asymptotic complexity of \(A^*\) tree searching.

DOI10.1007/BF01543474zbMath1034.68554MaRDI QIDQ1354031

Henry W. Davis, Stephen V. Chenoweth

Publication date: 13 May 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Artificial intelligence (68T99)

Related Items (1)

The mathematical modeling of heuristics.

Cites Work

• Unnamed Item
• Unnamed Item
• Probabilistic analysis of the complexity of A*
• Knowledge versus search: a quantitative analysis using A*
• The mathematical modeling of heuristics.
• Cost-error relationships in A* tree-searching
• Three approaches to heuristic search in networks
• Search Algorithms Under Different Kinds of Heuristics—A Comparative Study

This page was built for publication: New approaches for understanding the asymptotic complexity of \(A^*\) tree searching.