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

Noureddine Bouhmala. Improving the Asymptotic Convergence of Memetic Algorithms - The SAT Problem Case Study. In Agostinho C. Rosa, António Dourado Correia, Kurosh Madani, Joaquim Filipe, Janusz Kacprzyk, editors, IJCCI 2012 - Proceedings of the 4th International Joint Conference on Computational Intelligence, Barcelona, Spain, 5 - 7 October, 2012. pages 294-296, SciTePress, 2012.

Abstract

Abstract is missing.