论文部分内容阅读
In tree (or graph) search,most algorithms mainly use the local heuristic information of each indi-vidual node.But in the statistical heuristic search algorithms the global information about subtrees isused effectively so that the computational complexity is greatly reduced.In this paper the problem ofhow the global information can be extracted from the local one is discussed.Some features of SA arealso concerned.
In tree (or graph) search, most algorithms mainly use the local heuristic information of each indi-vidual node.But in the statistical heuristic search algorithms the global information about subtrees isused so so the computational complexity is greatly reduced. In this paper the problem ofhow the global information can be extracted from the local one is discussed. Some features of SA arealso concerned.