loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Author: Noureddine Bouhmala

Affiliation: Vestfold University College, Norway

ISBN: 978-989-8565-33-4

Keyword(s): Satisfiability Problem, Memetic Algorithm, Multilevel Techniques.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Computational Intelligence ; Evolutionary Computing ; Memetic Algorithms ; Soft Computing

Abstract: In this work, a memetic algorithm that makes use of the multilevel paradigm for solving SAT problems is presented. The multilevel paradigm refers to the process of dividing large and difficult problems into smaller ones, which are hopefully much easier to solve, and then work backward towards the solution of the original problem, using a solution from a previous level as a starting solution at the next level. Results on real industrial instances are presented.

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.214.184.250

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Bouhmala, N. (2012). Improving the Asymptotic Convergence of Memetic Algorithms - The SAT Problem Case Study.In Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2012) ISBN 978-989-8565-33-4, pages 294-296. DOI: 10.5220/0004153702940296

@conference{ecta12,
author={Noureddine Bouhmala.},
title={Improving the Asymptotic Convergence of Memetic Algorithms - The SAT Problem Case Study},
booktitle={Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2012)},
year={2012},
pages={294-296},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004153702940296},
isbn={978-989-8565-33-4},
}

TY - CONF

JO - Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2012)
TI - Improving the Asymptotic Convergence of Memetic Algorithms - The SAT Problem Case Study
SN - 978-989-8565-33-4
AU - Bouhmala, N.
PY - 2012
SP - 294
EP - 296
DO - 10.5220/0004153702940296

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.