Pages that link to "Item:Q1102135"
From MaRDI portal
The following pages link to Admissibility of \(AO^ *\) when heuristics overestimate (Q1102135):
Displayed 10 items.
- Weighted heuristic anytime search: new schemes for optimization over graphical models (Q513336) (← links)
- Admissibility of \(AO^ *\) when heuristics overestimate (Q1102135) (← links)
- Generalized best first search using single and multiple heuristics (Q1186365) (← links)
- Heuristic search in restricted memory (Q1263290) (← 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)
- Anytime search in dynamic graphs (Q2389673) (← links)
- ANALYZING VULNERABILITIES OF CRITICAL INFRASTRUCTURES USING FLOWS AND CRITICAL VERTICES IN AND/OR GRAPHS (Q5696968) (← links)
- LAO*: A heuristic search algorithm that finds solutions with loops (Q5941311) (← links)
- The \(PN^{*}\)-search algorithm: Application to tsume-shogi (Q5941318) (← links)