A result on the computational complexity of heuristic estimates for the A algorithm.
Marco ValtortaPublished in: Inf. Sci. (1984)
Keyphrases
- computational complexity
- optimal solution
- dynamic programming
- learning algorithm
- extremal optimization
- simulated annealing
- computational cost
- computationally efficient
- linear programming
- cost function
- np hard
- high accuracy
- worst case
- preprocessing
- computational efficiency
- probabilistic model
- experimental evaluation
- final result
- search space
- bin packing
- objective function
- times faster
- ant colony optimization
- detection algorithm
- bit rate
- special case
- k means
- video sequences
- optimization algorithm
- tabu search
- particle swarm optimization
- solution quality
- search procedure
- packing problem
- depth first search
- high computational complexity
- lower bound
- worst case performance ratio