530 search results - page 1 / 106 » An Algorithm for Approximating the Satisfiability Problem of... |
ENTCS
2008
13 years 4 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
PAMI
2010
13 years 3 months ago
2010
The notion of using context information for solving high-level vision and medical image segmentation problems has been increasingly realized in the field. However, how to learn a...
SIAMJO
2010
12 years 11 months ago
2010
Necessary first-order sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. These conditions are sati...
JSAT
2006
13 years 4 months ago
2006
Semidefinite optimization, commonly referred to as semidefinite programming, has been a remarkably active area of research in optimization during the last decade. For combinatoria...