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...

Ful tanımlama

Kaydedildi:
Detaylı Bibliyografya
Yayımlandı:Journal of Computer Science and Technology
Asıl Yazarlar: Enrique Alba, Bernabé Dorronsoro, Hugo Alfonso
Materyal Türü: Artigo
Dil:Inglês
Baskı/Yayın Bilgisi: Universidad Nacional de La Plata 2005
Konular:
Computación
SAT problem
memetic algorithms
Cellular evolutionary algorithms
Online Erişim:https://www.redalyc.org/articulo.oa?id=638067343025
Etiketler: Etiketle
Etiket eklenmemiş, İlk siz ekleyin!

Benzer Materyaller