4117 search results - page 100 / 824 » On the Satisfiability of Complex Constraints |
187
click to vote
ETFA
2006
IEEE
15 years 10 months ago
2006
IEEE
Classical off-line approaches based on preemption such as RM (Rate Monotonic), DM (Deadline Monotonic), EDF (Earliest Deadline First), LLF (Least Laxity First), etc, give schedula...
163
click to vote
CP
1995
Springer
15 years 10 months ago
1995
Springer
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 ...
172
click to vote
AAAI
1996
15 years 7 months ago
1996
We present a method for specifying temporal constraints on trajectories of dynamical systems and enforcing them during qualitative simulation. This capability can be used to focus...
221
click to vote
ASIAN
2009
Springer
15 years 7 months ago
2009
Springer
In their work on tractable deduction systems, D. McAllester and later D. Basin and H. Ganzinger have identified a property of inference systems (the locality property) that ensures...
161
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We propose a framework for deployment and subsequent autonomic management of component-based distributed applications. An initial deployment goal is specified using a declarative ...