default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhan Trung Hai Nguyen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j3]Per Kristian Lehre, Phan Trung Hai Nguyen
:
Runtime Analyses of the Population-Based Univariate Estimation of Distribution Algorithms on LeadingOnes. Algorithmica 83(10): 3238-3280 (2021)- 2020
- [j2]Phan Trung Hai Nguyen, Dirk Sudholt:
Memetic algorithms outperform evolutionary algorithms in multimodal optimisation. Artif. Intell. 287: 103345 (2020)
2010 – 2019
- 2019
- [j1]Duc-Cuong Dang, Per Kristian Lehre, Phan Trung Hai Nguyen:
Level-Based Analysis of the Univariate Marginal Distribution Algorithm. Algorithmica 81(2): 668-702 (2019) - [c5]Per Kristian Lehre, Phan Trung Hai Nguyen:
On the limitations of the univariate marginal distribution algorithm to deception and where bivariate EDAs might help. FOGA 2019: 154-168 - [c4]Per Kristian Lehre, Phan Trung Hai Nguyen:
Runtime analysis of the univariate marginal distribution algorithm under low selective pressure and prior noise. GECCO 2019: 1497-1505 - [i6]Per Kristian Lehre, Phan Trung Hai Nguyen:
Runtime Analysis of the Univariate Marginal Distribution Algorithm under Low Selective Pressure and Prior Noise. CoRR abs/1904.09239 (2019) - [i5]Per Kristian Lehre, Phan Trung Hai Nguyen:
On the Limitations of the Univariate Marginal Distribution Algorithm to Deception and Where Bivariate EDAs might help. CoRR abs/1907.12438 (2019) - 2018
- [c3]Phan Trung Hai Nguyen, Dirk Sudholt:
Memetic algorithms beat evolutionary algorithms on the class of hurdle problems. GECCO 2018: 1071-1078 - [c2]Per Kristian Lehre, Phan Trung Hai Nguyen:
Level-Based Analysis of the Population-Based Incremental Learning Algorithm. PPSN (2) 2018: 105-116 - [i4]Per Kristian Lehre, Phan Trung Hai Nguyen:
Improved Runtime Bounds for the Univariate Marginal Distribution Algorithm via Anti-Concentration. CoRR abs/1802.00721 (2018) - [i3]Phan Trung Hai Nguyen, Dirk Sudholt:
Memetic Algorithms Beat Evolutionary Algorithms on the Class of Hurdle Problems. CoRR abs/1804.06173 (2018) - [i2]Per Kristian Lehre, Phan Trung Hai Nguyen:
Level-Based Analysis of the Population-Based Incremental Learning Algorithm. CoRR abs/1806.01710 (2018) - [i1]Duc-Cuong Dang, Per Kristian Lehre, Phan Trung Hai Nguyen:
Level-Based Analysis of the Univariate Marginal Distribution Algorithm. CoRR abs/1807.10038 (2018) - 2017
- [c1]Per Kristian Lehre, Phan Trung Hai Nguyen:
Improved runtime bounds for the univariate marginal distribution algorithm via anti-concentration. GECCO 2017: 1383-1390
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-25 05:39 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:
