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...
Guardado en:
| 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
-
Cellular memetic algorithms
por: Alba Torres, Enrique, et al.
Publicado: (2005) -
A runnable functional formal memetic algorithm framework
por: Krasnogor, Natalio, et al.
Publicado: (1998) -
Biclustering in data mining using a memetic multi-objective evolutionary algorithm
por: Gallo, Cristian Andrés, et al.
Publicado: (2008) -
A parallel spatial quantum search algorithm applied to the 3-SAT problem
por: Hernández Barreto, Miguel A., et al.
Publicado: (2011) -
A randomized algorithm for solving the satisfiability problem
por: Cecchi, Laura
Publicado: (1997)