A New Result on the Complexity of Heuristic Estimates for the A* Algorithm.
Othar HanssonAndrew MayerMarco ValtortaPublished in: CoRR (2018)
Keyphrases
- computational complexity
- dynamic programming
- optimal solution
- preprocessing
- learning algorithm
- worst case
- experimental evaluation
- space complexity
- cost function
- search space
- np hard
- computational cost
- linear complexity
- high accuracy
- particle swarm optimization
- optimization algorithm
- final result
- exhaustive search
- times faster
- simulated annealing
- ant colony optimization
- detection algorithm
- segmentation algorithm
- theoretical analysis
- expectation maximization
- significant improvement
- neural network
- matching algorithm
- state space
- combinatorial optimization
- recognition algorithm
- probabilistic model
- complexity analysis
- data structure
- image segmentation
- worst case performance ratio