Pages that link to "Item:Q1198022"
From MaRDI portal
The following pages link to Effective use of memory in iterative deepening search (Q1198022):
Displaying 6 items.
- Reducing reexpansions in iterative-deepening search by controlling cutoff bounds (Q1187216) (← links)
- An upper bound on the time complexity of iterative-deepening-\(A^*\) (Q1354042) (← links)
- On the asymptotic performance of IDA (Q1370597) (← links)
- \(\text{BIDA}^*\): An improved perimeter search algorithm (Q1855228) (← links)
- Iterative-deepening search with on-line tree size prediction (Q2248554) (← links)
- Heuristic search strategies for multiobjective state space search (Q5955789) (← links)