Up: Computer science [Top][Contents]
A stochastic greedy local search for SAT that
operates on a randomly chosen unsat clause,
where it flips either
either a randomly chosen variable or the variable with the least breakcount,
depending on the “random walk” probability.
(Selman, Kautz, and Cohen 1994)