Sciweavers

156 search results - page 2 / 32
» Parallel SAT Solving using Bit-level Operations
Sort
View
AISC
2008
Springer
13 years 9 months ago
Strategies for Solving SAT in Grids by Randomized Search
Grid computing offers a promising approach to solving challenging computational problems in an environment consisting of a large number of easily accessible resources. In this pape...
Antti Eero Johannes Hyvärinen, Tommi A. Juntt...
ACTA
2006
154views more  ACTA 2006»
13 years 7 months ago
Solving HPP and SAT by P Systems with Active Membranes and Separation Rules
The P systems (or membrane systems) are a class of distributed parallel computing devices of a biochemical type, where membrane division is the frequently investigated way for obta...
Linqiang Pan, Artiom Alhazov
SAT
2009
Springer
126views Hardware» more  SAT 2009»
14 years 2 months ago
Extending SAT Solvers to Cryptographic Problems
Cryptography ensures the confidentiality and authenticity of information but often relies on unproven assumptions. SAT solvers are a powerful tool to test the hardness of certain ...
Mate Soos, Karsten Nohl, Claude Castelluccia
CPAIOR
2010
Springer
13 years 5 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
SC
2003
ACM
14 years 26 days ago
GridSAT: A Chaff-based Distributed SAT Solver for the Grid
We present GridSAT, a parallel and complete satisfiability solver designed to solve non-trivial SAT problem instances using a large number of widely distributed and heterogeneous...
Wahid Chrabakh, Richard Wolski