摘要
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 is used effectively so that the computational complexity is greatly reduced.In this paper the problem of how the global information can be extracted from the local one is discussed.Some features of SA are also 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 is used effectively so that the computational complexity is greatly reduced.In this paper the problem of how the global information can be extracted from the local one is discussed.Some features of SA are also concerned.
基金
This work is supported in part by National Natural Science Foundation.
