Adding upper-bound pruning to IDA*.
Armand PrieditisPublished in: J. Exp. Theor. Artif. Intell. (1997)
Keyphrases
- upper bound
- lower bound
- branch and bound algorithm
- search tree
- branch and bound
- worst case
- search space
- upper and lower bounds
- search algorithm
- pruning algorithm
- pruning method
- iterative deepening
- lower and upper bounds
- branching factor
- machine learning
- generalization error
- constant factor
- pruning algorithms
- tree pruning
- sliding tile
- pruning strategy
- dynamic programming
- heuristic function
- sample complexity
- constraint satisfaction problems
- computational complexity
- reinforcement learning
- data mining
- database