The following pages link to Luke Hunsberger (Q262128):
Displaying 9 items.
- Efficient execution of dynamically controllable simple temporal networks with uncertainty (Q262129) (← links)
- Dynamic controllability via timed game automata (Q329422) (← links)
- Faster Dynamic Controllability Checking for Simple Temporal Networks with Uncertainty (Q5079774) (← links)
- Sound-and-Complete Algorithms for Checking the Dynamic Controllability of Conditional Simple Temporal Networks with Uncertainty. (Q5079782) (← links)
- Reducing epsilon-DC Checking for Conditional Simple Temporal Networks to DC Checking (Q5079783) (← links)
- Simple Temporal Networks: A Practical Foundation for Temporal Representation and Reasoning (Invited Talk). (Q6080260) (← links)
- A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form (Q6116194) (← links)
- Incorporating decision nodes into conditional simple temporal networks (Q6486429) (← links)
- A streamlined model of conditional simple temporal networks -- semantics and equivalence results (Q6486431) (← links)