Pages that link to "Item:Q792766"
From MaRDI portal
The following pages link to A heuristic search algorithm with modifiable estimate (Q792766):
Displaying 22 items.
- Heuristic search through islands (Q578930) (← links)
- Inconsistent heuristics in theory and practice (Q646508) (← links)
- A result on the computational complexity of heuristic estimates for the \(A^*\) algorithm (Q761039) (← links)
- Depth-first iterative-deepening: An optimal admissible tree search (Q1062761) (← links)
- Generalized best first search using single and multiple heuristics (Q1186365) (← links)
- Heuristic search in restricted memory (Q1263290) (← links)
- Utility of pathmax in partial order heuristic search (Q1352123) (← links)
- New approaches for understanding the asymptotic complexity of \(A^*\) tree searching. (Q1354031) (← 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)
- \(\text{BIDA}^*\): An improved perimeter search algorithm (Q1855228) (← links)
- Improving search efficiency using possible subgoals (Q1906981) (← links)
- Completeness and admissibility for general heuristic search algorithms -- a theoretical study: Basic concepts and proofs (Q1969682) (← links)
- Iterative-deepening search with on-line tree size prediction (Q2248554) (← links)
- A more effective version of algorithm A (Q2770733) (← links)
- (Q3033346) (← links)
- The compressed differential heuristic (Q5145426) (← links)
- Enhanced Partial Expansion A* (Q5419479) (← links)
- LAO*: A heuristic search algorithm that finds solutions with loops (Q5941311) (← links)
- Heuristic search strategies for multiobjective state space search (Q5955789) (← links)
- Learning for efficient search (Q5955790) (← links)
- Heuristically ordered search in state graphs (Q6602248) (← links)
