A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
An adaptive evolutionary algorithm for the satisfiability problem
2000
Proceedings of the 2000 ACM symposium on Applied computing - SAC '00
This paper introduces an adaptive heuristic-based evolution ary algorithm for the Satisfiability problem (SAT). The algo rithm uses information about the best solutions found in the recent past in order to dynamically adapt the search strat egy. Extensive experiments on standard benchmark prob lems for SAT are performed in order to asses the effectiveness of the proposed technique. The results of the experiments indicate th a t this technique is rather successful: it improves on previous
doi:10.1145/335603.335912
dblp:conf/sac/RossiMK00
fatcat:cwz2yq7jbvbwdppbf2jsuay4zu