Generalized best first search using single and multiple heuristics
From MaRDI portal
Publication:1186365
DOI10.1016/0020-0255(92)90009-WzbMath0764.68025MaRDI QIDQ1186365
Sujoy Ghose, Partha Pratim Chakrabarti, S. C. de Sarkar
Publication date: 28 June 1992
Published in: Information Sciences (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68P10: Searching and sorting
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Cites Work
- Unnamed Item
- Heuristic search through islands
- A heuristic search algorithm with modifiable estimate
- General branch and bound, and its relation to \(A^*\) and \(AO^*\)
- Admissibility of \(AO^ *\) when heuristics overestimate
- Increasing search efficiency using multiple heuristics
- Three approaches to heuristic search in networks
- AND/OR graph heuristic search methods
- Studies in Semi-Admissible Heuristics
- The Power of Dominance Relations in Branch-and-Bound Algorithms
- Optimizing decision trees through heuristically guided search