Sciweavers

250 search results - page 42 / 50
» The complexity of temporal constraint satisfaction problems
Sort
View
LICS
2007
IEEE
14 years 2 months ago
The Cost of Punctuality
In an influential paper titled “The Benefits of Relaxing Punctuality” [2], Alur, Feder, and Henzinger introduced Metric Interval Temporal Logic (MITL) as a fragment of the r...
Patricia Bouyer, Nicolas Markey, Joël Ouaknin...
DAC
1998
ACM
14 years 9 months ago
Rate Derivation and Its Applications to Reactive, Real-Time Embedded Systems
An embedded system the system continuously interacts with its environment under strict timing constraints, called the external constraints, and it is important to know how these e...
Ali Dasdan, Dinesh Ramanathan, Rajesh K. Gupta
CPAIOR
2010
Springer
13 years 6 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
ATAL
2004
Springer
14 years 2 months ago
Decentralized Markov Decision Processes with Event-Driven Interactions
Decentralized MDPs provide a powerful formal framework for planning in multi-agent systems, but the complexity of the model limits its usefulness. We study in this paper a class o...
Raphen Becker, Shlomo Zilberstein, Victor R. Lesse...
AIPS
2009
13 years 9 months ago
Flexible Execution of Plans with Choice
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...
Patrick R. Conrad, Julie A. Shah, Brian C. William...