Pages that link to "Item:Q3771665"
From MaRDI portal
The following pages link to AND/OR graph heuristic search methods (Q3771665):
Displaying 14 items.
- Admissibility of \(AO^ *\) when heuristics overestimate (Q1102135) (← links)
- Generalized best first search using single and multiple heuristics (Q1186365) (← links)
- Backward fuzzy heuristic search algorithm FBHAO\(^*\) for fuzzy general and/or graph (Q1319457) (← links)
- Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search (Q1321063) (← links)
- An efficient algorithm for searching implicit AND/OR graphs with cycles (Q1589573) (← links)
- Algorithms and conditional lower bounds for planning problems (Q2238604) (← links)
- Optimization problems involving collections of dependent objects (Q2271875) (← links)
- Strong planning under partial observability (Q2457630) (← links)
- A general heuristic bottom-up procedure for searching AND/OR graphs (Q2639647) (← links)
- Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition (Q3189650) (← links)
- Games with Opacity Condition (Q3646261) (← links)
- ANALYZING VULNERABILITIES OF CRITICAL INFRASTRUCTURES USING FLOWS AND CRITICAL VERTICES IN AND/OR GRAPHS (Q5696968) (← links)
- (Q5743484) (← links)
- The \(PN^{*}\)-search algorithm: Application to tsume-shogi (Q5941318) (← links)
