Heuristic tree search with nonparametric statistical inference methods

DOI10.1080/00207169108803965zbMath0723.68097OpenAlexW2090610375WikidataQ126244360 ScholiaQ126244360MaRDI QIDQ3210918

Weixiong Zhang, Nageswara S. V. Rao

Publication date: 1991

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169108803965

zbMATH Keywords

statistical inferenceheuristic searchnonparametric statistic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Complexity of computation (including implicit computational complexity) (03D15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Corrected explicit-implicit domain decomposition algorithms for two-dimensional semilinear parabolic equations

Cites Work

• Unnamed Item
• Unnamed Item
• Heuristic search through islands
• Depth-first iterative-deepening: An optimal admissible tree search
• Statistical heuristic search
• Probabilistic analysis of the complexity of A*
• Knowledge versus search: a quantitative analysis using A*
• On the complexity of admissible search algorithms
• On the optimality of A
• A general theorem with applications on exponentially bounded stopping time, without moment conditions
• A New Heuristic Search Technique-Algorithm SA

This page was built for publication: Heuristic tree search with nonparametric statistical inference methods