default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Pelikan
- > Home > Persons > Martin Pelikan
Publications
- 2015
[p10]Martin Pelikan
, Mark Hauschild, Fernando G. Lobo:
Estimation of Distribution Algorithms. Handbook of Computational Intelligence 2015: 899-928- 2012
- [j13]Mark Hauschild, Martin Pelikan, Kumara Sastry, David E. Goldberg:
Using Previous Models to Bias Structural Learning in the Hierarchical BOA. Evol. Comput. 20(1): 135-160 (2012) - [c63]Martin Pelikan, Mark Hauschild:
Distance-based bias in model-directed optimization of additively decomposable problems. GECCO 2012: 273-280 - [c62]Mark Hauschild, Sanjiv K. Bhatia, Martin Pelikan:
Image segmentation using a genetic algorithm and hierarchical local search. GECCO 2012: 633-640 - [c59]Martin Pelikan, Mark Hauschild, Pier Luca Lanzi:
Transfer Learning, Soft Distance-Based Bias, and the Hierarchical BOA. PPSN (1) 2012: 173-183 - [i13]Martin Pelikan, Mark Hauschild:
Distance-Based Bias in Model-Directed Optimization of Additively Decomposable Problems. CoRR abs/1201.2241 (2012) - [i12]Martin Pelikan, Mark Hauschild:
Transfer Learning, Soft Distance-Based Bias, and the Hierarchical BOA. CoRR abs/1203.5443 (2012) - 2011
- [j11]Mark Hauschild, Martin Pelikan:
An introduction and survey of estimation of distribution algorithms. Swarm Evol. Comput. 1(3): 111-128 (2011) - [c58]Mark Hauschild, Martin Pelikan:
Advanced neighborhoods and problem difficulty measures. GECCO 2011: 625-632 - [c56]Martin Pelikan, Mark Hauschild, Dirk Thierens:
Pairwise and problem-specific distance metrics in the linkage tree genetic algorithm. GECCO 2011: 1005-1012 - 2010
- [c52]Mark Hauschild, Martin Pelikan:
Network crossover performance on NK landscapes and deceptive problems. GECCO 2010: 713-720 - [c50]Mark Hauschild, Martin Pelikan:
Performance of Network Crossover on NK Landscapes and Spin Glasses. PPSN (2) 2010: 462-471 - 2009
- [j9]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) - [c49]Mark Hauschild, Martin Pelikan:
Intelligent bias of network structures in the hierarchical BOA. GECCO 2009: 413-420 - [c45]Martin Pelikan, Kumara Sastry, David E. Goldberg, Martin V. Butz, Mark Hauschild:
Performance of evolutionary algorithms on NK landscapes with nearest neighbor interactions and tunable overlap. GECCO 2009: 851-858 - 2008
- [c42]Mark Hauschild, Martin Pelikan, Kumara Sastry, David E. Goldberg:
Using previous models to bias structural learning in the hierarchical BOA. GECCO 2008: 415-422 - [c35]Mark Hauschild, Martin Pelikan:
Enhancing Efficiency of Hierarchical BOA Via Distance-Based Model Restrictions. PPSN 2008: 417-427 - [p9]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
- [c34]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 - [c33]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
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-19 01:00 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:
