default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCláudio F. Lima
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j3]Cláudio F. Lima, Fernando G. Lobo
, Martin Pelikan, David E. Goldberg:
Model accuracy in the Bayesian optimization algorithm. Soft Comput. 15(7): 1351-1371 (2011)- 2010
- [c18]Fernando G. Lobo, Cláudio F. Lima:
Towards automated selection of estimation of distribution algorithms. GECCO (Companion) 2010: 1945-1952
2000 – 2009
- 2009
- [j2]Tian-Li Yu, David E. Goldberg, Kumara Sastry, Cláudio F. Lima, Martin Pelikan:
Dependency Structure Matrix, Genetic Algorithms, and Effective Recombination. Evol. Comput. 17(4): 595-626 (2009) - [j1]Mark Hauschild, Martin Pelikan, Kumara Sastry, Cláudio F. Lima:
Analyzing Probabilistic Models in Hierarchical BOA. IEEE Trans. Evol. Comput. 13(6): 1199-1217 (2009) - [c17]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 - [c16]Cláudio F. Lima, Martin Pelikan, Fernando G. Lobo, David E. Goldberg:
Loopy Substructural Local Search for the Bayesian Optimization Algorithm. SLS 2009: 61-75 - 2008
- [c15]Carlos M. Fernandes, Cláudio F. Lima, Agostinho C. Rosa:
UMDAs for dynamic optimization problems. GECCO 2008: 399-406 - [c14]Cláudio F. Lima, Fernando G. Lobo, Martin Pelikan:
From mating pool distributions to model overfitting. GECCO 2008: 431-438 - [c13]Cláudio F. Lima, Carlos M. Fernandes, Fernando G. Lobo:
Investigating restricted tournament replacement in ECGA for non-stationary environments. GECCO 2008: 439-446 - [p2]Cláudio F. Lima, Martin Pelikan, David E. Goldberg, Fernando G. Lobo, Kumara Sastry, Mark Hauschild:
Linkage Learning Accuracy in the Bayesian Optimization Algorithm. Linkage in Evolutionary Computation 2008: 87-107 - 2007
- [c12]Cláudio F. Lima, Martin Pelikan, David E. Goldberg, Fernando G. Lobo, Kumara Sastry, Mark Hauschild:
Influence of selection and replacement strategies on linkage learning in BOA. IEEE Congress on Evolutionary Computation 2007: 1083-1090 - [c11]Mark Hauschild, Martin Pelikan, Cláudio F. Lima, Kumara Sastry:
Analyzing probabilistic models in hierarchical BOA on traps and spin glasses. GECCO 2007: 523-530 - [c10]Xavier Llorà, Kumara Sastry, Cláudio F. Lima, Fernando G. Lobo, David E. Goldberg:
Linkage Learning, Rule Representation, and the X-Ary Extended Compact Classifier System. IWLCS 2007: 189-205 - [p1]Fernando G. Lobo, Cláudio F. Lima:
Adaptive Population Sizing Schemes in Genetic Algorithms. Parameter Setting in Evolutionary Algorithms 2007: 185-204 - [e1]Fernando G. Lobo, Cláudio F. Lima, Zbigniew Michalewicz:
Parameter Setting in Evolutionary Algorithms. Studies in Computational Intelligence 54, Springer 2007, ISBN 978-3-540-69431-1 [contents] - 2006
- [c9]Kumara Sastry, Paul Winward, David E. Goldberg, Cláudio F. Lima:
Fluctuating Crosstalk as a Source of Deterministic Noise and Its Effects on GA Scalability. EvoWorkshops 2006: 740-751 - [c8]Kumara Sastry, Cláudio F. Lima, David E. Goldberg:
Evaluation relaxation using substructural information and linear estimation. GECCO 2006: 419-426 - [c7]Fernando G. Lobo, Cláudio F. Lima:
On the utility of the multimodal problem generator for assessing the performance of evolutionary algorithms. GECCO 2006: 1233-1240 - [c6]Fernando G. Lobo, Cláudio F. Lima:
Revisiting evolutionary algorithms with on-the-fly population size adjustment. GECCO 2006: 1241-1248 - [c5]Cláudio F. Lima, Martin Pelikan, Kumara Sastry, Martin V. Butz, David E. Goldberg, Fernando G. Lobo:
Substructural Neighborhoods for Local Search in the Bayesian Optimization Algorithm. PPSN 2006: 232-241 - [i4]Fernando G. Lobo, Cláudio F. Lima:
On the utility of the multimodal problem generator for assessing the performance of Evolutionary Algorithms. CoRR abs/cs/0602051 (2006) - [i3]Fernando G. Lobo, Cláudio F. Lima:
Revisiting Evolutionary Algorithms with On-the-Fly Population Size Adjustment. CoRR abs/cs/0602055 (2006) - 2005
- [c4]Fernando G. Lobo, Cláudio F. Lima:
A review of adaptive population sizing schemes in genetic algorithms. GECCO Workshops 2005: 228-234 - [c3]Cláudio F. Lima, Kumara Sastry, David E. Goldberg, Fernando G. Lobo:
Combining competent crossover and mutation operators: a probabilistic model building approach. GECCO 2005: 735-742 - 2004
- [c2]Fernando G. Lobo, Cláudio F. Lima, Hugo Martires:
An Architecture for Massive Parallelization of the Compact Genetic Algorithm. GECCO (2) 2004: 412-413 - [c1]Cláudio F. Lima, Fernando G. Lobo:
Parameter-Less Optimization with the Extended Compact Genetic Algorithm and Iterated Local Search. GECCO (1) 2004: 1328-1339 - [i2]Cláudio F. Lima, Fernando G. Lobo:
Parameter-less Optimization with the Extended Compact Genetic Algorithm and Iterated Local Search. CoRR cs.NE/0402047 (2004) - [i1]Fernando G. Lobo, Cláudio F. Lima, Hugo Martires:
An architecture for massive parallelization of the compact genetic algorithm. CoRR cs.NE/0402049 (2004)
Coauthor Index
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-04-24 23:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
