450 search results - page 43 / 90 » Satisfiability with Exponential Families |
SAT
2005
Springer
15 years 5 months ago
2005
Springer
Current algorithms for bounded model checking (BMC) use SAT methods for checking satisfiability of Boolean formulas. These BMC methods suffer from a potential memory explosion prob...
SAT
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so i...
COLT
2006
Springer
15 years 3 months ago
2006
Springer
We consider the problem of optimality, in a minimax sense, and adaptivity to the margin and to regularity in binary classification. We prove an oracle inequality, under the margin ...
UAI
2008
15 years 1 months ago
2008
Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal...
AUTOMATICA
2008
14 years 12 months ago
2008
We consider the problem of stabilization of a one-dimensional wave equation that contains instability at its free end and control on the opposite end. In contrast to classical col...