Sciweavers

18 search results - page 3 / 4
» An In-Out Approach to Disjunctive Optimization
Sort
View
CP
1995
Springer
14 years 1 months ago
Partial Constraint Satisfaction
We present a method for finding optimal partial solutions to overconstrained instances of the Disjunctive Temporal Problems (DTP). The solutions are optimal in that they satisfy ...
Eugene C. Freuder, Richard J. Wallace
PODC
2000
ACM
14 years 2 months ago
Debugging distributed programs using controlled re-execution
Distributed programs are hard to write. A distributed debugger equipped with the mechanism to re-execute the traced computation in a controlled fashion can greatly facilitate the ...
Neeraj Mittal, Vijay K. Garg
AAAI
2004
13 years 11 months ago
Low-cost Addition of Preferences to DTPs and TCSPs
We present an efficient approach to adding soft constraints, in the form of preferences, to Disjunctive Temporal Problems (DTPs) and their subclass Temporal Constraint Satisfactio...
Bart Peintner, Martha E. Pollack
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
14 years 10 months ago
ZStream: a cost-based query processor for adaptively detecting composite events
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
Yuan Mei, Samuel Madden
AAAI
2006
13 years 11 months ago
Temporal Preference Optimization as Weighted Constraint Satisfaction
We present a new efficient algorithm for obtaining utilitarian optimal solutions to Disjunctive Temporal Problems with Preferences (DTPPs). The previous state-of-the-art system ac...
Michael D. Moffitt, Martha E. Pollack