The following pages link to (Q2999180):
Displaying 5 items.
- Planning and execution with flexible timelines: a formal account (Q329417) (← links)
- Efficient processing of simple temporal networks with uncertainty: algorithms for dynamic controllability verification (Q329426) (← links)
- Complexity issues for timeline-based planning over dense time under future and minimal semantics (Q2067619) (← links)
- On timeline-based games and their complexity (Q2310766) (← links)
- A game-theoretic approach to timeline-based planning with uncertainty (Q5079781) (← links)