Back to Results
First PageMeta Content
Applied mathematics / Mathematics / Boolean satisfiability problem / Local search / Constraint satisfaction / WalkSAT / Theoretical computer science / Constraint programming / Logic in computer science


Artificial Intelligence–150 Local search characteristics of incomplete SAT procedures ✩ Dale Schuurmans ∗ , Finnegan Southey Department of Computer Science, University of Waterloo, Waterloo, ON N2L
Add to Reading List

Document Date: 2005-06-24 17:14:13


Open Document

File Size: 218,96 KB

Share Result on Facebook
UPDATE