Pages that link to "Item:Q5941316"
From MaRDI portal
The following pages link to Time complexity of iterative-deepening-\(A^{*}\) (Q5941316):
Displaying 13 items.
- Inconsistent heuristics in theory and practice (Q646508) (← links)
- Average-case analysis of best-first search in two representative directed acyclic graphs (Q814592) (← links)
- Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces (Q901034) (← links)
- Potential-based bounded-cost search and anytime non-parametric A* (Q2014923) (← links)
- Iterative-deepening search with on-line tree size prediction (Q2248554) (← links)
- Predicting optimal solution cost with conditional probabilities (Q2254628) (← links)
- Probably bounded suboptimal heuristic search (Q2321255) (← links)
- Heuristics as Markov chains (Q2350029) (← links)
- Duality in permutation state spaces and the dual search algorithm (Q2389626) (← links)
- Maximizing over multiple pattern databases speeds up heuristic search (Q2457594) (← links)
- HEURISTIC SEARCH UNDER CONTRACT (Q3224350) (← links)
- Heuristic Hill-Climbing as a Markov Process (Q3534666) (← links)
- Disjoint pattern database heuristics (Q5958199) (← links)
