The following pages link to (Q3489496):
Displaying 12 items.
- Linear-space best-first search (Q685539) (← links)
- A faster alternative to \(SSS^*\) with extension to variable memory (Q689627) (← links)
- Improving the efficiency of depth-first search by cycle elimination (Q1209308) (← links)
- \(\text{BIDA}^*\): An improved perimeter search algorithm (Q1855228) (← links)
- Improving search efficiency using possible subgoals (Q1906981) (← links)
- Finding optimal solutions to the graph partitioning problem with heuristic search (Q2502154) (← links)
- Performance of linear-space search algorithms (Q5917443) (← links)
- Performance of linear-space search algorithms (Q5925571) (← links)
- Planning as heuristic search (Q5941310) (← links)
- Planning and control in artificial intelligence: A unifying perspective (Q5945807) (← links)
- Heuristic search strategies for multiobjective state space search (Q5955789) (← links)
- Heuristically ordered search in state graphs (Q6602248) (← links)
