610 search results - page 102 / 122 » Using SAT in QBF |
121
click to vote
POPL
2010
ACM
16 years 16 days ago
2010
ACM
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
101
click to vote
ICCAD
2005
IEEE
16 years 1 days ago
2005
IEEE
— In this paper we propose an exact algorithm that maximizes the sharing of partial terms in Multiple Constant Multiplication (MCM) operations. We model this problem as a Boolean...
120
click to vote
CAV
2009
Springer
15 years 10 months ago
2009
Springer
The DPLL approach to the Boolean satisfiability problem (SAT) is a combination of search for a satisfying assignment and logical deduction, in which each process guides the other....
122
click to vote
IPPS
2009
IEEE
15 years 9 months ago
2009
IEEE
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
122
click to vote
SACMAT
2009
ACM
15 years 9 months ago
2009
ACM
Publish-subscribe (pub-sub) systems are useful for many applications, including pervasive environments. In the latter context, however, great care must be taken to preserve the pr...