Sciweavers

428 search results - page 29 / 86
» FPGA-Based SAT Solver
Sort
View
IEEEHPCS
2010
13 years 6 months ago
Portfolio-based Parallel SAT solving
Abstract. In this paper, we explore the two well-known principles of diversification and intensification in portfolio-based parallel SAT solving. These dual concepts play an impo...
Lakhdar Sais
ICCD
2005
IEEE
114views Hardware» more  ICCD 2005»
14 years 4 months ago
State Set Management for SAT-based Unbounded Model Checking
In recent years, Boolean Satisfiability (SAT) has been shown to hold potential for Unbounded Model Checking (UMC). The success of SAT-based UMC largely relies on (i) the SAT solv...
Kameshwar Chandrasekar, Michael S. Hsiao
CEC
2007
IEEE
14 years 2 months ago
SAT-decoding in evolutionary algorithms for discrete constrained optimization problems
— For complex optimization problems, several population-based heuristics like Multi-Objective Evolutionary Algorithms have been developed. These algorithms are aiming to deliver ...
Martin Lukasiewycz, Michael Glaß, Christian ...
KR
2010
Springer
14 years 15 days ago
Distributed Nonmonotonic Multi-Context Systems
We present a distributed algorithm for computing equilibria of heterogeneous nonmonotonic multi-context systems (MCS). The algorithm can be parametrized to compute only partial eq...
Minh Dao-Tran, Thomas Eiter, Michael Fink, Thomas ...
SAT
2004
Springer
106views Hardware» more  SAT 2004»
14 years 1 months ago
Local Search with Bootstrapping
We propose and study a technique to improve the performance of those local-search SAT solvers that proceed by executing a prespecified number of tries, each starting with an eleme...
Lengning Liu, Miroslaw Truszczynski