ERA: An algorithm for reducing the epistasis of SAT problems

DOI10.1007/3-540-45110-2_4MaRDI QIDQ4449705zbMATH OpenFDO

Authors Eduardo Rodriguez-Tello, Jose Torres-Jimenez

Publication date 11 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2724/27241283.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99)

Recommendations

• Evolutionary computing for the satisfiability problem
• Solving the SAT problem based on evolutionary algorithm
• A genetic algorithm for probabilistic SAT problem
• Recombination operators for satisfiability problems
• Solving SAT Problem Based on Hybrid Differential Evolution Algorithm

This page was built for publication: ERA: An algorithm for reducing the epistasis of SAT problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449705)