971 search results - page 51 / 195 » Approximate Satisfiability and Equivalence |
DAM
2008
13 years 10 months ago
2008
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...
COMBINATORICA
2010
13 years 4 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
IJCAI
2003
13 years 11 months ago
2003
Efficient implementations of DPLL with the addition of clause learning are the fastest complete satisfiability solvers and can handle many significant real-world problems, such as...
JSYML
2008
13 years 10 months ago
2008
We investigate strictly positive finitely additive measures on Boolean algebras and strictly positive Radon measures on compact zerodimensional spaces. The motivation is to find a ...
ICML
2010
IEEE
13 years 10 months ago
2010
IEEE
We investigate the sparse eigenvalue problem which arises in various fields such as machine learning and statistics. Unlike standard approaches relying on approximation of the l0n...