Dillenburg, J. F.; Nelson, P. C. Improving search efficiency using possible subgoals. (English) Zbl 0842.90039 Math. Comput. Modelling 22, No. 4-7, 397-414 (1995). MSC: 90B20 × Cite Format Result Cite Review PDF Full Text: DOI
Chakrabarti, P. P.; Ghose, S.; de Sarkar, S. C. Generalized best first search using single and multiple heuristics. (English) Zbl 0764.68025 Inf. Sci. 60, No. 1-2, 145-175 (1992). MSC: 68P10 68Q25 68T20 × Cite Format Result Cite Review PDF Full Text: DOI
Zhang, Weixiong; Rao, Nageswara S. V. Heuristic tree search with nonparametric statistical inference methods. (English) Zbl 0723.68097 Int. J. Comput. Math. 38, No. 3-4, 133-152 (1991). MSC: 68T20 68P10 68Q25 03D15 × Cite Format Result Cite Review PDF Full Text: DOI
Kundu, Sukhamay A new variant of the \(A^*\)-algorithm which closes a node at most once. (English) Zbl 1034.68712 Ann. Math. Artif. Intell. 4, No. 1-2, 157-176 (1991). MSC: 68W05 68T99 × Cite Format Result Cite Review PDF Full Text: DOI
Chakrabarti, P. P.; Ghose, S.; DeSarkar, S. C. Admissibility of \(AO^ *\) when heuristics overestimate. (English) Zbl 0643.68153 Artif. Intell. 34, No. 1, 97-113 (1988). MSC: 68T20 68P10 × Cite Format Result Cite Review PDF Full Text: DOI