On the practical importance of asymptotic optimality in certain heuristic algorithms.
Harilaos N. PsaraftisPublished in: Networks (1984)
Keyphrases
- asymptotic optimality
- learning algorithm
- data structure
- multi agent
- search algorithm
- significant improvement
- cost function
- asymptotically optimal
- times faster
- combinatorial optimization
- search methods
- hill climbing
- machine learning
- running times
- approximate solutions
- heuristic methods
- computational cost
- computational complexity
- optimal solution