|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
A New Heuristic Search Technique-Algorithm SA
January 1985 (vol. 7 no. 1)
pp. 103-107
| ASCII Text | x | ||
| Bo Zhang, Ling Zhang, "A New Heuristic Search Technique-Algorithm SA," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 7, no. 1, pp. 103-107, January, 1985. | |||
| BibTex | x | ||
| @article{ 10.1109/TPAMI.1985.4767624, author = {Bo Zhang and Ling Zhang}, title = {A New Heuristic Search Technique-Algorithm SA}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {7}, number = {1}, issn = {0162-8828}, year = {1985}, pages = {103-107}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.1985.4767624}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Pattern Analysis and Machine Intelligence TI - A New Heuristic Search Technique-Algorithm SA IS - 1 SN - 0162-8828 SP103 EP107 EPD - 103-107 A1 - Bo Zhang, A1 - Ling Zhang, PY - 1985 VL - 7 JA - IEEE Transactions on Pattern Analysis and Machine Intelligence ER - | |||
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.
Citation:
Bo Zhang, Ling Zhang, "A New Heuristic Search Technique-Algorithm SA," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 7, no. 1, pp. 103-107, Jan. 1985, doi:10.1109/TPAMI.1985.4767624
Usage of this product signifies your acceptance of the Terms of Use.