Toward a Search Strategy for Anytime Search in Linear Space Using Depth-First Branch and Bound.
Carlos HernándezJorge A. BaierPublished in: SOCS (2014)
Keyphrases
- search strategy
- search algorithm
- search space
- linear space
- depth first branch and bound
- search strategies
- branching factor
- depth first search
- hill climbing
- effective pruning
- iterative deepening
- search tree
- space efficient
- branch and bound
- evaluation function
- search problems
- nearest neighbor search
- memory efficient
- np hard