Pages that link to "Item:Q1589573"
From MaRDI portal
The following pages link to An efficient algorithm for searching implicit AND/OR graphs with cycles (Q1589573):
Displaying 5 items.
- State space search nogood learning: online refinement of critical-path dead-end detectors in planning (Q514137) (← links)
- Improving the efficiency of depth-first search by cycle elimination (Q1209308) (← links)
- Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search (Q1321063) (← links)
- Strong planning under partial observability (Q2457630) (← links)
- LAO*: A heuristic search algorithm that finds solutions with loops (Q5941311) (← links)