Abstract
In this paper, we present a new heuristic searching algorithm by introducing the statistical inference method on the basis of algorithm A (or A*). It is called algorithm SA. In a simplified search space, a uniform m-ary tree, we obtain the following result. Using algorithm SA, a goal node can be found with probability one, and its mean complexity is O(N·ln N) where N is the depth at which the goal is located.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Pattern Analysis and Machine Intelligence
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
