: . .,
. .,
. .
: SAT- SAT@HOME
:
:
: 2013
: ..
:
: 43
: . ., . ., . . SAT- SAT@HOME / . 43. .: , 2013. .138-156.
:
: , , , SAT@home.
(.): Boolean satisfiability problem, simulated annealing, volunteer computing, SAT@home.
: - , - SAT- - . SAT@home.
(.): We suggest an approach to construct decomposition sets for coarse-grained parallelization of SAT problems. Decomposition sets are used for distributed solving of hard SAT problems. The proposed algorithms are used in the volunteer computing project SAT@home.
PDF -
: 5307, : 1894, : 19.