A Result on the Computational Complexity of Heuristic Estimates for the A* Algorithm.
Marco ValtortaPublished in: IJCAI (1983)
Keyphrases
- computational complexity
- dynamic programming
- computationally efficient
- experimental evaluation
- preprocessing
- bin packing
- k means
- cost function
- np hard
- probabilistic model
- optimal solution
- detection algorithm
- optimization algorithm
- computational cost
- high accuracy
- matching algorithm
- computational efficiency
- solution quality
- search space
- memory requirements
- convergence rate
- times faster
- recognition algorithm
- greedy heuristic
- learning algorithm
- simulated annealing
- multi objective
- monte carlo
- worst case
- scheduling problem
- significant improvement
- exhaustive search
- final result
- beam search
- high computational complexity
- objective function
- neural network
- optimal or near optimal