Depth-First Branch-and-Bound vs. Depth-Bounded IDA*.
Armand PrieditisPublished in: Comput. Intell. (1998)
Keyphrases
- depth first branch and bound
- branching factor
- iterative deepening
- search tree
- depth first search
- evaluation function
- search algorithm
- search space
- path finding
- heuristic function
- alpha beta
- hill climbing
- optimal cost
- heuristic search
- search problems
- tree search
- memory efficient
- orders of magnitude
- b tree
- probabilistic model
- branch and bound
- total cost
- game tree
- simulated annealing