12
Views
4
CrossRef citations to date
0
Altmetric
Original Articles

Heuristic tree search with nonparametric statistical inference methods

&
Pages 133-152 | Received 23 Apr 1990, Published online: 08 May 2007

References

  • Chakrabarti , P. P. 1986 . Heuristic search through islands . Artificial Intelligence , 29 ( 3 ) : 339 – 347 .
  • Gelperin , D. 1977 . On the optimality of A ∗ . Artificial Intelligence , 8 ( 1 ) : 69 – 76 .
  • Hart , P. E. , Nilsson , N. J. and Raphael , B. 1968 . A formal basis for the heuristic determination of minimum cost paths . IEEE Trans. Systems, Science and Cybern , 4 ( 2 ) : 100 – 107 .
  • Huyn , N. , Dechter , R. and Pearl , J. 1980 . Probabilistic analysis of the complexity of A ∗ . Artificial Intelligence , 15 ( 3 ) : 241 – 254 .
  • Korf , R. E. 1988 . “ Search: A survey of recent results ” . In Exploring Artificial Intelligence , Edited by: Shrobe , H. E. 197 – 238 . Morgan Kaufman Pub., Inc. .
  • Korf , R. E. 1985 . Depth-first iterative-deeping: An optimal admissible tree search . Artificial Intelligence , 27 ( 1 ) : 97 – 110 .
  • Martelli , A. 1977 . On the complexity of admissible search algorithms . Artificial Intelligence , 8 ( 1 ) : 1 – 13 .
  • Muller-Funk , U. 1984 . “ Sequential nonparametric tests ” . In Handbook of Statistics , Edited by: Krishnaiah , P. R. and Sen , P. K. Vol. 4 , 657 – 698 . Elsevier Science Pub. .
  • Nilsson , N. J. 1980 . Principles of Artificial Intelligence Palo Alto, Calif Tioga
  • Pearl , J. 1981 . Proc. IJCAI-7 . Heuristic search theory: A survey of recent results . 1981 , Vancouver, British Columbia, Canada. pp. 24 – 28 .
  • Pearl , J. 1983 . Knowledge versus search: A quantitative analysis using A ∗ . Artificial Intelligence , 20 ( 1 ) 1 – 13 .
  • Pearl , J. 1984 . Heuristics: Intelligent Search Strategies for Computer Problem Solving , Addison-Wesley Pub. Company, Inc. .
  • Pohl , I. 1971 . “ Bi-directional search ” . In Machine Intelligence 6 , Edited by: Meltzer , B. and Michie , D. 127 – 140 . New York : American Elsevier .
  • Pohl , I. 1977 . “ Practical and theoretical consideration in heuristic search algorithm ” . In Machine Intelligence 8 , Edited by: Elcock , E. W. and Michie , D. 55 – 72 . New York : Wiley .
  • Wetherill , G. B. and Glazebreek , K. D. 1986 . Sequential Methods in Statistics , Chapman and Hall .
  • Wijsman , R. A. 1977 . A general theorem with applications on exponentially bounded stopping time, without moment conditions . The Annals of Statistics , 5 ( 2 ) : 292 – 315 .
  • Zhang , B. and Zhang , L. 1985 . A new heuristic search technique—algorithm SA . IEEE Trans. on Pattern Analysis and Machine Intelligence , 7 ( 1 ) : 103 – 107 .
  • Zhang , L. and Zhang , B. Proc. 6th ECAI-84 . The successive SA ∗ search and its computational complexity . pp. 249 – 258 .
  • Zhang , B. and Zhang , L. Proc. 9th IJCAI-85 . A new weighted technique in heuristic search . pp. 1037 – 1039 .
  • Zhang , B. and Zhang , L. 1987 . Statistical heuristic search . Journal of Computer Science and Technology , 2 ( 1 ) : 1 – 11 .
  • Zhang , W. 1988 . A study of weighting techniques in heuristic search . Chinese Journal of Computer , 11 ( 8 ) : 500 – 504 .
  • Zhang , W. 1989 . Proc. of IEEE Workshop on Tools for Artificial Intelligence: Architectures, Languages and Algorithms . NSA algorithm and its computational complexity—Preliminary results . Oct 23-25 1989 , Fairfax, VA. pp. 442 – 446 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.