default search action
Agostinho C. Rosa
- > Home > Persons > Agostinho C. Rosa
Publications
- 2020
- [j26]Carlos M. Fernandes, Nuno Fachada, Juan Luis Jiménez Laredo, Juan Julián Merelo Guervós, Agostinho C. Rosa:
Population sizing of cellular evolutionary algorithms. Swarm Evol. Comput. 58: 100721 (2020) - 2019
- [c87]Carlos M. Fernandes, Agostinho C. Rosa, Juan Luis Jiménez Laredo, Juan Julián Merelo Guervós:
Genealogical patterns in evolutionary algorithms. GECCO (Companion) 2019: 283-284 - 2018
- [c86]Carlos M. Fernandes, Agostinho C. Rosa, Juan Luis Jiménez Laredo, Juan Julián Merelo Guervós, Carlos Cotta:
Dynamic Models of Partially Connected Topologies for Population-Based Metaheuristics. CEC 2018: 1-8 - [c85]Carlos M. Fernandes, Agostinho C. Rosa, Nuno Fachada, Juan Luis Jiménez Laredo, Juan Julián Merelo Guervós:
Particle swarm and population structure. GECCO (Companion) 2018: 85-86 - [c84]Carlos M. Fernandes, Nuno Fachada, Juan Luis Jiménez Laredo, Juan Julián Merelo Guervós, Pedro A. Castillo, Agostinho C. Rosa:
Revisiting Population Structure and Particle Swarm Performance. IJCCI 2018: 248-254 - 2017
- [c82]Carlos M. Fernandes, Juan Luis Jiménez Laredo, Agostinho C. Rosa:
Spatially Structured Evolutionary Algorithms: Graph Degree, Population Size and Convergence Speed. IDC 2017: 15-25 - 2016
- [j13]Carlos M. Fernandes, Juan Luis Jiménez Laredo, Juan Julián Merelo Guervós, Carlos Cotta, Agostinho C. Rosa:
Dynamic Topologies for Particle Swarms. Trans. Comput. Collect. Intell. 24: 1-18 (2016) - 2014
- [c76]Carlos M. Fernandes, Juan Luis Jiménez Laredo, Juan Julián Merelo Guervós, Carlos Cotta, Agostinho C. Rosa:
Dynamic and Partially Connected Ring Topologies for Evolutionary Algorithms with Structured Populations. EvoApplications 2014: 665-677 - [c75]Carlos M. Fernandes, Juan Luis Jiménez Laredo, Juan Julián Merelo Guervós, Carlos Cotta, Agostinho C. Rosa:
Particle Swarms with Dynamic Topologies and Conservation of Function Evaluations. IJCCI (ECTA) 2014: 86-94 - [c74]Carlos M. Fernandes, Juan Luis Jiménez Laredo, Juan Julián Merelo Guervós, Carlos Cotta, Agostinho C. Rosa:
Particle Swarm Optimization with Dynamic Topology and Conservation of Evaluations. IJCCI (Selected Papers) 2014: 97-111 - [c71]Carlos M. Fernandes, Juan Luis Jiménez Laredo, Juan Julián Merelo Guervós, Carlos Cotta, Rafael Nogueras, Agostinho C. Rosa:
Shuffle and Mate: A Dynamic Model for Spatially Structured Evolutionary Algorithms. PPSN 2014: 50-59 - 2013
- [j9]Carlos M. Fernandes, Juan Luis Jiménez Laredo, Agostinho C. Rosa, Juan Julián Merelo Guervós:
The sandpile mutation Genetic Algorithm: an investigation on the working mechanisms of a diversity-oriented and self-organized mutation operator for non-stationary functions. Appl. Intell. 39(2): 279-306 (2013) - [c69]Carlos M. Fernandes, Agostinho C. Rosa, Juan Luis Jiménez Laredo, Carlos Cotta, Juan Julián Merelo Guervós:
A study on time-varying partially connected topologies for the particle swarm. IEEE Congress on Evolutionary Computation 2013: 2450-2456 - [c67]Carlos M. Fernandes, Juanlu J. Laredo, Juan Julián Merelo Guervós, Carlos Cotta, Agostinho C. Rosa:
Adapting the Bak-Sneppen Model to a Dynamic and Partially Connected Grid of Hierarchical Species. ECAL 2013: 523-530 - [c66]Carlos M. Fernandes, Juan Julián Merelo Guervós, Juan Luis Jiménez Laredo, Carlos Cotta, Agostinho C. Rosa:
Partially connected topologies for particle swarm. GECCO (Companion) 2013: 11-12 - [c65]Carlos M. Fernandes, Agostinho C. Rosa, Juan Luis Jiménez Laredo, Carlos Cotta, Juan Julián Merelo Guervós:
Performance and Scalability of Particle Swarms with Dynamic and Partially Connected Grid Topologies. IJCCI 2013: 47-55 - [c62]Rafael Nogueras, Carlos Cotta, Carlos M. Fernandes, Juan Luis Jiménez Laredo, Juan Julián Merelo Guervós, Agostinho C. Rosa:
An Analysis of a Selecto-Lamarckian Model of Multimemetic Algorithms with Dynamic Self-organized Topology. TPNC 2013: 205-216 - 2011
- [c49]Carlos M. Fernandes, Juan Luis Jiménez Laredo, Antonio Miguel Mora, Agostinho C. Rosa, Juan Julián Merelo Guervós:
A Study on the Mutation Rates of a Genetic Algorithm Interacting with a Sandpile. EvoApplications (1) 2011: 32-42 - [c47]Carlos M. Fernandes, Juan Luis Jiménez Laredo, Antonio Miguel Mora, Agostinho C. Rosa, Juan Julián Merelo Guervós:
The Sandpile Mutation Operator for Genetic Algorithms. LION 2011: 552-566 - 2009
- [c39]Carlos M. Fernandes, Cláudio F. Lima, Juan Luis Jiménez Laredo, Agostinho C. Rosa, Juan Julián Merelo Guervós:
An Ant-Based Rule for UMDA's Update Strategy. ECAL (2) 2009: 391-398 - 2008
- [c35]Antonio Miguel Mora, Carlos Miguel Fernandes, Juan Julián Merelo Guervós, Vitorino Ramos, Juan Luis Jiménez Laredo, Agostinho C. Rosa:
KohonAnts - A Self-Organizing Ant Algorithm for Clustering and Pattern Classification. ALIFE 2008: 428-435 - [c34]Carlos M. Fernandes, Antonio Miguel Mora, Juan Julián Merelo Guervós, Vitorino Ramos, Juan Luis Jiménez Laredo, Agostinho C. Rosa:
KANTS: Artifical Ant System for Classification. ANTS Conference 2008: 339-346 - [c30]Juan Luis Jiménez Laredo, Pedro A. Castillo, Antonio Miguel Mora, Juan Julián Merelo Guervós, Agostinho Cláudio da Rosa, Carlos M. Fernandes:
Evolvable Agents in Static and Dynamic Optimization Problems. PPSN 2008: 488-497
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint