Particle swarm and population structure

dc.contributor.authorFernandes, Carlos M.
dc.contributor.authorRosa, Agostinho C.
dc.contributor.authorFachada, Nuno
dc.contributor.authorLaredo, Juan L. J.
dc.contributor.authorMerelo, J. J.
dc.contributor.institutionEscola de Comunicação, Arquitetura, Artes e Tecnologias da Informação
dc.date.issued2018
dc.descriptionGECCO '18: Proceedings of the Genetic and Evolutionary Computation Conference Companion
dc.description.abstractWe investigate the convergence speed, accuracy, robustness and scalability of PSOs structured by regular and random graphs with 3 ≤ k ≤ n. The main conclusion is that regular and random graphs with the same averaged connectivity k may result in significantly different performance, namely when k is low.en
dc.description.statusNon peer reviewed
dc.formatapplication/pdf
dc.identifier.citationFernandes , C M , Rosa , A C , Fachada , N , Laredo , J L J & Merelo , J J 2018 , ' Particle swarm and population structure ' , Paper presented at ACM , 17/11/22 . https://doi.org/10.1145/3205651.3205779
dc.identifier.doihttps://doi.org/10.1145/3205651.3205779
dc.language.isoeng
dc.publisherACM
dc.rightsopenAccess
dc.subjectPOPULAÇÃO
dc.subjectOTIMIZAÇÃO POR ENXAME DE PARTÍCULAS
dc.subjectPARTICLE SWARM OPTIMIZATION
dc.subjectPOPULATION
dc.titleParticle swarm and population structureen
dc.typeconferenceObject

Ficheiros

Principais
A mostrar 1 - 1 de 1
Miniatura indisponível
Nome:
2018_gecco_pso.pdf
Tamanho:
1.06 MB
Formato:
Adobe Portable Document Format
Licença
A mostrar 1 - 1 de 1
Miniatura indisponível
Nome:
license.txt
Tamanho:
1.71 KB
Formato:
Item-specific license agreed upon to submission
Descrição: