SATenstein : automatically building local search SAT solvers from components
Designing high-performance solvers for computationally hard problems is a difficult and often time-consuming task. It is often the case that a new solver is created by augmenting an existing algorithm with a mechanism found in a different algorithm or by combining components from different alg...
Main Author: | |
---|---|
Format: | Others |
Language: | English |
Published: |
University of British Columbia
2009
|
Online Access: | http://hdl.handle.net/2429/13852 |