Three approaches to heuristic search in networks

DOI10.1145/2455.2458zbMath0633.68097OpenAlexW1971431151MaRDI QIDQ3771664

No author found.

Publication date: 1985

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2455.2458

zbMATH Keywords

propagationheuristic searchadmissible heuristicsearch grapharc markinginadmissible heuristics

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

New approaches for understanding the asymptotic complexity of \(A^*\) tree searching. ⋮ An upper bound on the time complexity of iterative-deepening-\(A^*\) ⋮ HEURISTIC SEARCH UNDER CONTRACT ⋮ Generalized best first search using single and multiple heuristics ⋮ Effective use of memory in iterative deepening search ⋮ Heuristic search in restricted memory ⋮ Anytime pack search ⋮ Truncated incremental search

This page was built for publication: Three approaches to heuristic search in networks