Pages that link to "Item:Q1187216"
From MaRDI portal
The following pages link to Reducing reexpansions in iterative-deepening search by controlling cutoff bounds (Q1187216):
Displaying 9 items.
- Linear-space best-first search (Q685539) (← links)
- Effective use of memory in iterative deepening search (Q1198022) (← links)
- Agent searching in a tree and the optimality of iterative deepening (Q1341670) (← links)
- On the design of a constructive algorithm to solve the multi-peg towers of Hanoi problem (Q1566738) (← links)
- Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization (Q1592632) (← links)
- \(\text{BIDA}^*\): An improved perimeter search algorithm (Q1855228) (← links)
- Potential-based bounded-cost search and anytime non-parametric A* (Q2014923) (← links)
- Iterative-deepening search with on-line tree size prediction (Q2248554) (← links)
- On uniqueness of solution to the multi-peg towers of hanoi (Q2752267) (← links)
