Using Boinc Desktop Grid To Solve Large Scale Sat Problems
Many practically important combinatorial problems can be efficiently reducedto a problem of Boolean satisfiability (SAT). Therefore, the implementation ofdistributed algorithms for solving SAT problems is of great importance. In thisarticle we describe a technology for organizing desktop grid, which...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AGH University of Science and Technology Press
2012-01-01
|
| Series: | Computer Science |
| Subjects: | |
| Online Access: | http://journals.agh.edu.pl/csci/article/download/37/30 |