Cellular memetic algorithms evaluated on SAT

In this work, we study the behavior of several cellular memetic algorithms (cMAs) when solving the satisfiability problem (SAT). The proposed cMAs are the result of including hybridization techniques in dif- ferent structural ways into a canonical cellular genetic algorithm (cGA). Specifically, we...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Alba Torres, Enrique, Dorronsoro, Bernabé, Alfonso, Hugo
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2005
Materias:
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/22955
Aporte de:

Ejemplares similares