Average-case analysis of best-first search in two representative directed acyclic graphs


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… (More)
DOI: 10.1016/j.artint.2004.01.001


6 Figures and Tables

Slides referencing similar topics