A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Average-case analysis of best-first search in two representative directed acyclic graphs
2004
Artificial Intelligence
Many problems that arise in the real world have search spaces that are graphs rather than trees. Understanding the properties of search algorithms and analyzing their performance have been major objectives of research in AI. But most published work on the analysis of search algorithms has been focused on tree search, and comparatively little has been reported on graph search. One of the major obstacles in analyzing average-case complexity of graph search is that no single graph can serve as a
doi:10.1016/j.artint.2004.01.001
fatcat:k3qqduilq5dp3fwgznig6jvndu