Improving Stochastic Local Search for SAT with a New Probability Distribution-Reference-Cited by-同舟云学术

Improving Stochastic Local Search for SAT with a New Probability Distribution

Published:2010 Issue: Volume: Page:10-15
ISSN:0302-9743
Container-title:Theory and Applications of Satisfiability Testing – SAT 2010
language:
Short-container-title:

Author:

Balint Adrian,Fröhlich Andreas

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-14186-7_3

Reference8 articles.

1. Lecture Notes in Computer Science;A. Balint,2009

2. bwGRiD, member of the German D-Grid initiative, funded by the Ministry for Education and Research and the Ministry for Science, Research and Arts Baden-Württemberg, http://www.bw-grid.de

3. Hoos, H.H.: An adaptive noise mechanism for WalkSAT. In: Proceedings of AAAI 2002, pp. 635–660 (2002)

4. Lecture Notes in Computer Science;C.M. Li,2005

5. McAllester, D., Selman, B., Kautz, H.: Evidence for invariant in local search. In: Proceedings of AAAI 1997, pp. 321–326 (1997)

Cited by 61 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. HSMVS: heuristic search for minimum vertex separator on massive graphs;PeerJ Computer Science;2024-05-17

2. Reduction-Based MAX-3SAT with Low Nonlinearity and Lattices Under Recombination;Lecture Notes in Computer Science;2024

3. Improving two-mode algorithm via probabilistic selection for solving satisfiability problem;Information Sciences;2024-01

4. Remote Sensing Image Retrieval Algorithm for Dense Data;Remote Sensing;2023-12-26

5. CAmpactor: A Novel and Effective Local Search Algorithm for Optimizing Pairwise Covering Arrays;Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering;2023-11-30