207 search results - page 22 / 42 » Synthesizing Switching Logic Using Constraint Solving |
AAECC
1999
Springer
15 years 28 days ago
1999
Springer
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
128
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
113
click to vote
ACSD
2007
IEEE
15 years 7 months ago
2007
IEEE
We study sensor minimization problems in the context of fault diagnosis. Fault diagnosis consists in synthesizing a diagnoser that observes a given plant and identifies faults in...
152
click to vote
TMC
2012
13 years 3 months ago
2012
Abstract—We consider the problem of relay-assisted transmission for cellular networks. In the considered system, a source node together with n relay nodes are selected in a propo...
112
click to vote
CDC
2010
IEEE
14 years 8 months ago
2010
IEEE
This paper deals with the existence and synthesis of parameterized-(control) Lyapunov functions (p-(C)LFs) for discrete-time nonlinear systems that are possibly subject to constrai...