Cellular memetic algorithms
This work is focussed on the development and analysis of a new class of algorithms, called cellular memetic algorithms (cMAs), which will be evaluated here on the satisfiability problem (SAT). For describing a cMA, we study the effects of adding specific knowledge of the problem to the fitness funct...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Postgraduate Office, School of Computer Science, Universidad Nacional de La Plata
2005-12-01
|
| Series: | Journal of Computer Science and Technology |
| Subjects: | |
| Online Access: | https://journal.info.unlp.edu.ar/JCST/article/view/845 |