Improving the Asymptotic Convergence of Memetic Algorithms - The SAT Problem Case Study

Noureddine Bouhmala

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

Improving the Asymptotic Convergence of Memetic Algorithms - The SAT Problem Case Study

Topics: Memetic Algorithms

In Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 0IJCCI, 294-296, 2012 , Barcelona, Spain

Author: Noureddine Bouhmala

Affiliation: Vestfold University College, Norway

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.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

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

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 (IJCCI 2012) - ECTA; ISBN 978-989-8565-33-4; ISSN 2184-3236, SciTePress, 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 (IJCCI 2012) - ECTA},
year={2012},
pages={294-296},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004153702940296},
isbn={978-989-8565-33-4},
issn={2184-3236},
}

TY - CONF

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