The following pages link to (Q4411159):
Displaying 13 items.
- The influence of \(k\)-dependence on the complexity of planning (Q420826) (← links)
- Limitations of acyclic causal graphs for planning (Q490647) (← links)
- Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks (Q814531) (← links)
- Causal graphs and structurally restricted planning (Q988572) (← links)
- Symbolic perimeter abstraction heuristics for cost-optimal planning (Q1647507) (← links)
- Star-topology decoupled state space search (Q1749386) (← links)
- Backdoors to planning (Q2321271) (← links)
- Red-black planning: a new systematic approach to partial delete relaxation (Q2344359) (← links)
- A complete parameterized complexity analysis of bounded planning (Q2353405) (← links)
- On the complexity of planning for agent teams and its implications for single agent planning (Q2446582) (← links)
- The Causal Graph Revisited for Directed Model Checking (Q3392922) (← links)
- On-the-Fly Macros (Q3638281) (← links)
- Computational Complexity of Computing Symmetries in Finite-Domain Planning (Q5856495) (← links)
