AND/OR graph heuristic search methods
From MaRDI portal
Publication:3771665
DOI10.1145/2455.2459zbMath0633.68098OpenAlexW2044354687WikidataQ129480563 ScholiaQ129480563MaRDI QIDQ3771665
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.2459
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (14)
Admissibility of \(AO^ *\) when heuristics overestimate ⋮ A general heuristic bottom-up procedure for searching AND/OR graphs ⋮ Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition ⋮ ANALYZING VULNERABILITIES OF CRITICAL INFRASTRUCTURES USING FLOWS AND CRITICAL VERTICES IN AND/OR GRAPHS ⋮ Strong planning under partial observability ⋮ Generalized best first search using single and multiple heuristics ⋮ Algorithms and conditional lower bounds for planning problems ⋮ The \(PN^{*}\)-search algorithm: Application to tsume-shogi ⋮ Optimization problems involving collections of dependent objects ⋮ Games with Opacity Condition ⋮ An efficient algorithm for searching implicit AND/OR graphs with cycles ⋮ Unnamed Item ⋮ Backward fuzzy heuristic search algorithm FBHAO\(^*\) for fuzzy general and/or graph ⋮ Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search
This page was built for publication: AND/OR graph heuristic search methods
