Abstract
Abstract Abstract Stochastic search algorithms have proven to be very fast at solving many satisfiability problems [2,3,8]. The nature of their search requires careful parameter tuning to maximize performance, but depending on the problem and the details of the stochastic algorithm, the correct tuning may be difficult to ascertain [9]. In this paper we introduce Auto-Walksat , a general algorithm which automatically tunes any variant of the Walksat family of stochastic satisfiability solvers. We demonstrate Auto-Walksat's success in tuning Walksat-SKC to the DIMACS benchmark problems with negligible additional overhead.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
