Search Algorithms Under Different Kinds of Heuristics—A Comparative Study
From MaRDI portal
Publication:3962476
DOI10.1145/322358.322359zbMath0497.68035OpenAlexW1995927890MaRDI QIDQ3962476
No author found.
Publication date: 1983
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322358.322359
Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (10)
Utility of pathmax in partial order heuristic search ⋮ New approaches for understanding the asymptotic complexity of \(A^*\) tree searching. ⋮ An upper bound on the time complexity of iterative-deepening-\(A^*\) ⋮ A new variant of the \(A^*\)-algorithm which closes a node at most once. ⋮ Increasing search efficiency using multiple heuristics ⋮ Inconsistent heuristics in theory and practice ⋮ Properties of a class of trivalent network graphs and optimal routing ⋮ Heuristic estimates in shortest path algorithms ⋮ Heuristic search through islands ⋮ Heuristic search strategies for multiobjective state space search
This page was built for publication: Search Algorithms Under Different Kinds of Heuristics—A Comparative Study
