Dimitri Klimenko

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Among classical search algorithms with the same heuristic information , with sufficient memory A* is essentially as fast as possible in finding a proven optimal solution. However, in many situations optimal solutions are simply infeasible, and thus search algorithms that trade solution quality for speed are desirable. In this paper, we formalize the process(More)
  • 1