(ACM, 2018) Fernandes,Carlos M.; Rosa,Agostinho C.; Fachada,Nuno; Laredo,Juan L. J.; Merelo,J. J.; Escola de Comunicação, Arquitetura, Artes e Tecnologias da Informação
We 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.