Pages that link to "Item:Q4421283"
From MaRDI portal
The following pages link to Handling contingency in temporal constraint networks: from consistency to controllabilities (Q4421283):
Displaying 27 items.
- Efficient execution of dynamically controllable simple temporal networks with uncertainty (Q262129) (← links)
- Planning and execution with flexible timelines: a formal account (Q329417) (← links)
- Dynamic controllability via timed game automata (Q329422) (← links)
- Constraint solving in uncertain and dynamic environments: A survey (Q816686) (← links)
- An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty (Q892228) (← links)
- Allocation and scheduling of conditional task graphs (Q969530) (← links)
- Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games (Q1706770) (← links)
- Strong temporal planning with uncontrollable durations (Q1748463) (← links)
- Flexibility and decoupling in simple temporal networks (Q2014926) (← links)
- Quantifying controllability in temporal networks with uncertainty (Q2046026) (← links)
- Mining CSTNUDs significant for a set of traces is polynomial (Q2051798) (← links)
- Determining temporal agreements in cross-organizational business processes (Q2051815) (← links)
- Group planning with time constraints (Q2248560) (← links)
- On timeline-based games and their complexity (Q2310766) (← links)
- Complexity bounds for the controllability of temporal networks with conditions, disjunctions, and uncertainty (Q2321284) (← links)
- Solving strong controllability of temporal problems with uncertainty using SMT (Q2342602) (← links)
- Extending uncertainty formalisms to linear constraints and other complex formalisms (Q2379316) (← links)
- The algebra \(\text{IA}^{\text{fuz}}\): a framework for qualitative fuzzy temporal reasoning (Q2457614) (← links)
- Handling fuzzy temporal constraints in a planning environment (Q2468753) (← links)
- New Integral Approach to the Specification of STPU-Solutions (Q2814136) (← links)
- Scheduling Conditional Task Graphs (Q3523074) (← links)
- A game-theoretic approach to timeline-based planning with uncertainty (Q5079781) (← links)
- Safe Multi-Agent Pathfinding with Time Uncertainty (Q5856485) (← links)
- Mining Significant Temporal Networks Is Polynomial (Q6060099) (← links)
- Dynamic controllability of temporal networks with instantaneous reaction (Q6205017) (← links)
- Dynamic controllability of temporal plans in uncertain and partially observable environments (Q6488804) (← links)
- On expected value strong controllability (Q6535432) (← links)