Sciweavers

19 search results - page 1 / 4
» Backtracking Algorithms for Disjunctions of Temporal Constra...
Sort
View
AAAI
1998
13 years 8 months ago
Backtracking Algorithms for Disjunctions of Temporal Constraints
Weextendthe frameworkof simple temporalproblems studied originally by Dechter,MeiriandPearl to consider constraints of the formxl - yl < rl V... v xn yn <_rn, wherexl ... xn...
Kostas Stergiou, Manolis Koubarakis
IEAAIE
2001
Springer
13 years 12 months ago
A Mixed Closure-CSP Method to Solve Scheduling Problems
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
María Isabel Alfonso Galipienso, Federico B...
JAIR
2000
105views more  JAIR 2000»
13 years 7 months ago
Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts
We introduce a temporal model for reasoning on disjunctive metric constraints on intervals and time points in temporal contexts. This temporal model is composed of a labeled tempo...
Federico Barber
CP
2007
Springer
14 years 1 months ago
Strong Controllability of Disjunctive Temporal Problems with Uncertainty
The Disjunctive Temporal Problem with Uncertainty (DTPU) is an extension of the Disjunctive Temporal Problem (DTP) that accounts for events not under the control of the executing a...
Bart Peintner, Kristen Brent Venable, Neil Yorke-S...
AIPS
2008
13 years 9 months ago
Fast Dynamic Scheduling of Disjunctive Temporal Constraint Networks through Incremental Compilation
Autonomous systems operating in real-world environments must plan, schedule, and execute missions while robustly adapting to uncertainty and disturbance. One way to mitigate the e...
Julie A. Shah, Brian C. Williams