104 search results - page 8 / 21 » Hierarchical Hardness Models for SAT |
ICTAC
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. P systems (known also as membrane systems) are biologically motivated theoretical models of distributed and parallel computing. The two most interesting questions in the ...
FM
2008
Springer
13 years 10 months ago
2008
Springer
Declarative specifications exhibit a variety of problems, such as inadvertently overconstrained axioms and underconstrained conjectures, that are hard to diagnose with model checki...
AAAI
2000
13 years 9 months ago
2000
Equivalency clauses (Xors or modulo 2 arithmetics) represent a common structure in the SAT-encoding of many hard real-world problems and constitute a major obstacle to DavisPutnam...
CP
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. In this paper we consider the problem of computing the density of states of a Boolean formula in CNF, a generalization of both MAX-SAT and model counting. Given a Boolean...
MIRAGE
2009
Springer
14 years 3 months ago
2009
Springer
This paper presents a markerless motion capture pipeline based on volumetric reconstruction, skeletonization and articulated ICP with hard constraints. The skeletonization produces...