@InProceedings{selman+1994,
  author       = {Selman, Bart and Kautz, Henry A. and Cohen, Brain},
  title        = {Noise strategies for improving local search},
  booktitle    = {Proceedings of the Twelfth AAAI National Conference on
                  Artificial Intelligence},
  year         = 1994,
  series       = {AAAI'94},
  pages        = {337–343},
  publisher    = {AAAI Press},
  abstract     = {It has recently been shown that local search is surprisingly
                  good at finding satisfying assignments for certain
                  computationally hard classes of CNF formulas. The performance
                  of basic local search methods can be further enhanced by
                  introducing mechanisms for escaping from local minima in the
                  search space. We will compare three such mechanisms:
                  simulated annealing, random noise, and a strategy called
                  "mixed random walk". We show that mixed random walk is the
                  superior strategy. We also present results demonstrating the
                  effectiveness of local search with walk for solving circuit
                  synthesis and circuit diagnosis problems. Finally, we
                  demonstrate that mixed random walk improves upon the best
                  known methods for solving MAX-SAT problems.},
  numpages     = 7,
  location     = {Seattle, Washington},
  url          = {https://dl.acm.org/doi/10.5555/2891730.2891782}
}