Skip to main content
SpringerLink
Log in

Why SA can beat the exponential explosion in heuristic search

  • Regular Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

In tree (or graph) search, most algorithms mainly use the local heuristic information of each individual 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 is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. Pearl, Heuristics, Addison-Wesley Publishing Company, 1984.

  2. J. Pearl, Heuristic search theory: survey of recent results, in Proc. 7th IJCAL-81, 554–562.

  3. Zhang Bo and Zhang Ling, Statistical heuristic search,J. of Comput. Sci. & Technol.,2:1 (1987), 1–11.

    Article  MATH  Google Scholar 

  4. Zhang Bo and Zhang Ling, The comparison between the statistical heuristic search and A,J. of Comput. Sci. & Technol. 4:2 (1989), 126–132.

    Article  MATH  Google Scholar 

  5. G. B. Wetherill, Sequential Method in Statistics, John Wiley & Sons, Inc., 1975.

  6. S. Zacks, The Theory of Statistical Inference, John Wiley & Sons, Inc., 1971.

Download references

Author information

Authors and Affiliations

  1. Tsinghua University, Tsinghua, China

    Zhang Bo

  2. Anqing Teacher’s College, Anqing, China

    Zhang Ling

Authors
  1. Zhang Bo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhang Ling
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work is supported in part by National Natural Science Foundation.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, B., Zhang, L. Why SA can beat the exponential explosion in heuristic search. J. of Comput. Sci. & Technol. 5, 259–265 (1990). https://doi.org/10.1007/BF02945314

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02945314

Keywords

Search

Navigation