Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 224,979,794 papers from all fields of science
Search
Sign In
Create Free Account
WalkSAT
Known as:
MaxWalkSat
In computer science, GSAT and WalkSat are local search algorithms to solve Boolean satisfiability problems. Both algorithms work on formulae in…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
Algorithm
Bart Selman
Boolean satisfiability problem
Clause (logic)
Expand
Broader (4)
Automated theorem proving
Constraint programming
Logic in computer science
Operations research
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Experimental analyses of the K-hidden algorithm
Dongdong Zhao
,
Wenjian Luo
,
Ran Liu
,
Lihua Yue
Engineering applications of artificial…
2017
Corpus ID: 46095672
2015
2015
Lifted Symmetry Detection and Breaking for MAP Inference
T. Kopp
,
Parag Singla
,
Henry A. Kautz
Neural Information Processing Systems
2015
Corpus ID: 7686466
Symmetry breaking is a technique for speeding up propositional satisfiability testing by adding constraints to the theory that…
Expand
2015
2015
Hiding multiple solutions in a hard 3-SAT formula
Ran Liu
,
Wenjian Luo
,
Lihua Yue
Data & Knowledge Engineering
2015
Corpus ID: 10984844
2010
2010
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
D. Pankratov
,
A. Borodin
International Conference on Theory and…
2010
Corpus ID: 1426605
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem…
Expand
2009
2009
Self-Managing Associative Memory for Dynamic Acquisition of Expertise in High-Level Domains
J. Beal
International Joint Conference on Artificial…
2009
Corpus ID: 15230741
Self-organizing maps can be used to implement an associative memory for an intelligent system that dynamically learns about new…
Expand
2009
2009
Stochastic Local Search for SMT : a Preliminary Report ( extended abstract ) ∗
A. Griggio
,
R. Sebastiani
,
Silvia Tomasi
2009
Corpus ID: 8371378
A popular approach to SMT is based on the integration of theoryspecific decision procedures with a SAT solver based on DPLL. In…
Expand
Review
2007
Review
2007
Scaling and Probabilistic Smoothing (SAPS)
D. Tompkins
,
F. Hutter
,
H. Hoos
2007
Corpus ID: 5988541
The first part of this paper is essentially a reprint of the solver description from the 2005 competition, as the software…
Expand
2007
2007
efficient local search method for random 3-satisfiability
2007
Corpus ID: 17677592
Powered by TCPDF (www.tcpdf.org) This material is protected by copyright and other intellectual property rights, and duplication…
Expand
2004
2004
Very fast Simulated Annealing for HW-SW partitioning
Sudarshan Banerjee
,
N. Dutt
2004
Corpus ID: 14776466
Hardware/software (HW-SW) partitioning is a key problem in the codesign of embedded systems and has been studied extensively in…
Expand
2003
2003
Local Search on SAT-encoded Colouring Problems
S. Prestwich
International Conference on Theory and…
2003
Corpus ID: 1176261
Constraint satisfaction problems can be SAT-encoded in more than one way, and the choice of encoding can be as important as the…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE