Combining adaptive noise and look-ahead in local search for SAT

62Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The adaptive noise mechanism was introduced in Novelty+ to automatically adapt noise settings during the search [4]. The local search algorithm G 2WSAT deterministically exploits promising decreasing variables to reduce randomness and consequently the dependence on noise parameters. In this paper, we first integrate the adaptive noise mechanism in G2WSAT to obtain an algorithm adaptG2WSAT, whose performance suggests that the deterministic exploitation of promising decreasing variables cooperates well with this mechanism. Then, we propose an approach that uses look-ahead for promising decreasing variables to further reinforce this cooperation. We implement this approach in adaptG2WSAT, resulting in a new local search algorithm called adaptG2WSATP. Without any manual noise or other parameter tuning, adaptG2WSATP shows generally good performance, compared with G2WSAT with approximately optimal static noise settings, or is sometimes even better than G 2WSAT. In addition, adaptG2WSATP is favorably compared with state-of-the-art local search algorithms such as R+adapt Novelty+ and VW. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Li, C. M., Wei, W., & Zhang, H. (2007). Combining adaptive noise and look-ahead in local search for SAT. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4501 LNCS, pp. 121–133). Springer Verlag. https://doi.org/10.1007/978-3-540-72788-0_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free