50 search results - page 1 / 10 » Robust Satisfaction |
94
Voted
CONCUR
1999
Springer
15 years 4 months ago
1999
Springer
In order to check whether an open system satisfies a desired property, we need to check the behavior of the system with respect to an arbitrary environment. In the most general se...
115
Voted
FORMATS
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We consider temporal logic formulae specifying constraints in continuous time and space on the behaviors of continuous and hybrid dynamical system admitting uncertain par...
101
Voted
ECAI
2004
Springer
15 years 6 months ago
2004
Springer
Super solutions are a mechanism to provide robustness to constraint programs [10]. They are solutions in which, if a small number of variables lose their values, we are guaranteed ...
102
Voted
CSCLP
2004
Springer
15 years 6 months ago
2004
Springer
Super solutions provide a framework for finding robust solutions to Constraint Satisfaction Problems [5, 3]. We present a novel application of super solutions to combinatorial auc...
105
Voted
AAAI
1990
15 years 1 months ago
1990
This paper presents a projection algorithm for incremental control rule synthesis. The algorithm synthesizes an initial set of goal-achieving control rules using a combination of ...