971 search results - page 31 / 195 » Approximate Satisfiability and Equivalence |
LPAR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We develop and analyze clause elimination procedures, a specific family of simplification techniques for conjunctive normal form (CNF) formulas. Extending known procedu...
ECCV
2004
Springer
14 years 3 months ago
2004
Springer
Stochastic tracking of structured models in monolithic state spaces often requires modeling complex distributions that are difficult to represent with either parametric or sample...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...
COCO
2008
Springer
13 years 11 months ago
2008
Springer
We study the approximability of predicates on k variables from a domain [q], and give a new sufficient condition for such predicates to be approximation resistant under the Unique...
SIAMMA
2010
13 years 4 months ago
2010
Abstract. On product domains, sparse-grid approximation yields optimal, dimension-independent convergence rates when the function that is approximated has L2-bounded mixed derivati...