Instantly Turning a Naive Exhaustive Search into Three Efficient Searches with Pruning.
Takeshi MorimotoYasunao TakanoHideya IwasakiPublished in: PADL (2007)
Keyphrases
- exhaustive search
- brute force
- search space
- simulated annealing
- computationally feasible
- nearest neighbor search
- dynamic programming
- solution space
- computational complexity
- computationally expensive
- cost effective
- computationally efficient
- pruning strategy
- information retrieval
- evolutionary algorithm
- greedy search
- tree construction
- lower bound
- pruning algorithms