Pages that link to "Item:Q1354031"
From MaRDI portal
The following pages link to New approaches for understanding the asymptotic complexity of \(A^*\) tree searching. (Q1354031):
Displaying 4 items.
- Improved approximation algorithms for the average-case tree searching problem (Q476452) (← links)
- A result on the computational complexity of heuristic estimates for the \(A^*\) algorithm (Q761039) (← links)
- The mathematical modeling of heuristics. (Q1354035) (← links)
- Cost-error relationships in A* tree-searching (Q3474277) (← links)