79 search results - page 1 / 16 » Strategies for Solving SAT in Grids by Randomized Search |
AISC
2008
Springer
13 years 7 months ago
2008
Springer
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...
AIMSA
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. Computational Grids provide a widely distributed computing environment suitable for randomized SAT solving. This paper develops techniques for incorporating learning, kno...
AMAI
2004
Springer
13 years 10 months ago
2004
Springer
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
FPL
2003
Springer
13 years 10 months ago
2003
Springer
Local search methods such as WSAT have proven to be successful for solving SAT problems. In this paper, we propose two host-FPGA (Field Programmable Gate Array) co-implementations,...
IEEEHPCS
2010
13 years 3 months ago
2010
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...