Pages that link to "Item:Q1370597"
From MaRDI portal
The following pages link to On the asymptotic performance of IDA (Q1370597):
Displaying 9 items.
- Predicting the size of IDA\(^*\)'s search tree (Q360040) (← links)
- Inconsistent heuristics in theory and practice (Q646508) (← links)
- Reducing reexpansions in iterative-deepening search by controlling cutoff bounds (Q1187216) (← links)
- Improving the efficiency of depth-first search by cycle elimination (Q1209308) (← links)
- Agent searching in a tree and the optimality of iterative deepening (Q1341670) (← links)
- An upper bound on the time complexity of iterative-deepening-\(A^*\) (Q1354042) (← links)
- Iterative-deepening search with on-line tree size prediction (Q2248554) (← links)
- Parallel multithreaded IDA* heuristic search: algorithm design and performance evaluation (Q3072379) (← links)
- Performance of linear-space search algorithms (Q5917443) (← links)