The following pages link to (Q3493325):
Displayed 8 items.
- Managing concurrency in temporal planning using planner-scheduler interaction (Q834400) (← links)
- The SAT-based approach to separation logic (Q862390) (← links)
- Scheduling with neural networks -- the case of the Hubble Space Telescope (Q1200817) (← links)
- A uniform representation for time and space and their mutual constraints (Q1202659) (← links)
- Backtracking algorithms for disjunctions of temporal constraints (Q1575430) (← links)
- Querying temporal and spatial constraint networks in PTIME (Q1589478) (← links)
- Argumentation frameworks as constraint satisfaction problems (Q2248522) (← links)
- The octagon abstract domain for continuous constraints (Q2342596) (← links)