Using BOINC desktop grid to solve large scale SAT problems

Szczegóły
Opis

Tytuł:: Using BOINC desktop grid to solve large scale SAT problems
Autorzy:: Posypkin, M.
Semenov, A.
Zaikin, O.
Tematy:: desktop grid
Boolean satisfiability problem (SAT)
SAT
volunteer computing
BOINC
Data publikacji:: 2012
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Język:: angielski
Prawa:: CC BY: Creative Commons Uznanie autorstwa 3.0 PL
Źródło:: Computer Science; 2012, 13 (1); 25-34
1508-2806
2300-7036
Dostawca treści:: Biblioteka Nauki
: Artykuł

Przejdź do źródła

Many practically important combinatorial problems can be efficiently reduced to a problem of Boolean satisfiability (SAT). Therefore, the implementation of distributed algorithms for solving SAT problems is of great importance. In this article we describe a technology for organizing desktop grid, which is meant for solving SAT problems. This technology was implemented in the form of a volunteer computing project SAT@home based on a popular BOINC platform.

Informacja

Using BOINC desktop grid to solve large scale SAT problems