The following pages link to On the optimality of A (Q1232905):
Displaying 9 items.
- A result on the computational complexity of heuristic estimates for the \(A^*\) algorithm (Q761039) (← links)
- Probabilistic analysis of the complexity of A* (Q1146526) (← links)
- Knowledge versus search: a quantitative analysis using A* (Q1170890) (← links)
- Utility of pathmax in partial order heuristic search (Q1352123) (← links)
- An upper bound on the time complexity of iterative-deepening-\(A^*\) (Q1354042) (← links)
- A new variant of the \(A^*\)-algorithm which closes a node at most once. (Q1354068) (← links)
- Heuristic tree search with nonparametric statistical inference methods (Q3210918) (← links)
- Acceleration of the A*-Algorithm for the Shortest Path Problem in Digital Road Maps (Q5391964) (← links)
- Heuristic search strategies for multiobjective state space search (Q5955789) (← links)
