2917 search results - page 16 / 584 » Satisfying Interaction Constraints |
AAAI
2004
13 years 10 months ago
2004
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...
AUTOMATICA
2007
13 years 8 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...
TACAS
2010
Springer
13 years 6 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 ...
AUSAI
2007
Springer
14 years 21 days 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
13 years 8 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...