Parallel genetic algorithm for SAT problems based on OpenMP

DOI10.3969/J.ISSN.0258-2724.20170700MaRDI QIDQ5196240zbMATH OpenFDO

Authors

Publication date 2 October 2019

Full work available at URL https://doi.org/10.3969/J.ISSN.0258-2724.20170700

zbMATH Keywords

coarse-grained modelOpenMPparallel hybrid genetic algorithmSAT problem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Parallel algorithms in computer science (68W10) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50)

Recommendations

• scientific article; zbMATH DE number 828719
• scientific article; zbMATH DE number 5510692
• scientific article; zbMATH DE number 1304346
• Parallelisation of genetic algorithms for the 2-page crossing number problem
• Solving SAT Problem Based on Hybrid Differential Evolution Algorithm

Cited in

(1)

• Application of sedimentation algorithm for solving max-sat problem

This page was built for publication: Parallel genetic algorithm for SAT problems based on OpenMP

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