4117 search results - page 28 / 824 » On the Satisfiability of Complex Constraints |
77
Voted
AUTOMATICA
2007
14 years 9 months ago
2007
This paper is concerned with synthesis of output feedback controllers for descriptor systems to attain dissipativity of the closed-loop system. A necessary and sufficient conditio...
106
click to vote
TACAS
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
104
click to vote
AUSAI
2007
Springer
15 years 1 months ago
2007
Springer
Factor analysis is a statistical technique for reducing the number of factors responsible for a matrix of correlations to a smaller number of factors that may reflect underlying va...
IGPL
2006
14 years 9 months ago
2006
Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
Hybrid Scheduling Problems (HSPs) combine temporal and finite-domain variables via hybrid constraints that dictate that specific bounds on temporal constraints rely on assignments...