Pages that link to "Item:Q1575430"

The following pages link to Backtracking algorithms for disjunctions of temporal constraints (Q1575430):

Displaying 17 items.

• An initial study of time complexity in infinite-domain constraint satisfaction (Q514144) (← links)
• Optimal rectangle packing (Q610984) (← links)
• On the modelling and optimization of preferences in constraint-based temporal reasoning (Q646549) (← links)
• Efficient solution techniques for disjunctive temporal reasoning problems (Q814524) (← links)
• Consistency checking of STNs with decisions: managing temporal and access-control constraints in a seamless way (Q821554) (← links)
• The SAT-based approach to separation logic (Q862390) (← links)
• M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures (Q862395) (← links)
• Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games (Q1706770) (← links)
• Group planning with time constraints (Q2248560) (← links)
• Complexity bounds for the controllability of temporal networks with conditions, disjunctions, and uncertainty (Q2321284) (← links)
• Translation-based approaches for solving disjunctive temporal problems with preferences (Q2331097) (← links)
• Temporal reasoning about fuzzy intervals (Q2389652) (← links)
• Temporal Reasoning in Nested Temporal Networks with Alternatives (Q5302722) (← links)
• From binary temporal relations to non-binary ones and back (Q5941132) (← links)
• An interdisciplinary experimental evaluation on the disjunctive temporal problem (Q6080502) (← links)
• Reducing the number of disjuncts in DTPs (Q6116184) (← links)
• Adding flexibility to uncertainty: flexible simple temporal networks with uncertainty (FTNU) (Q6188212) (← links)