Остановите войну!
for scientists:
default search action
Pietro S. Oliveto
- > Home > Persons > Pietro S. Oliveto
Publications
- 2023
- [c60]Per Kristian Lehre, Pietro Simone Oliveto:
Runtime Analysis of Population-based Evolutionary Algorithms - Part I: Steady State EAs. GECCO Companion 2023: 1271-1300 - 2022
- [c59]Per Kristian Lehre, Pietro S. Oliveto:
Runtime analysis of population-based evolutionary algorithms. GECCO Companion 2022: 1398-1426 - 2021
- [c57]Per Kristian Lehre, Pietro S. Oliveto:
Runtime analysis of evolutionary algorithms: basic introduction. GECCO Companion 2021: 399-425 - [c56]Per Kristian Lehre, Pietro S. Oliveto:
Runtime analysis of population-based evolutionary algorithms. GECCO Companion 2021: 856-880 - 2020
- [c53]Per Kristian Lehre, Pietro S. Oliveto:
Runtime analysis of population-based evolutionary algorithms: introductory tutorial at GECCO 2020. GECCO Companion 2020: 458-494 - 2019
- [c47]Per Kristian Lehre, Pietro S. Oliveto:
Runtime analysis of evolutionary algorithms: basic introduction: introductory tutorial at GECCO 2019. GECCO (Companion) 2019: 662-693 - 2018
- [j11]Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton:
Escaping Local Optima Using Crossover With Emergent Diversity. IEEE Trans. Evol. Comput. 22(3): 484-497 (2018) - [c40]Per Kristian Lehre, Pietro S. Oliveto:
Runtime analysis of evolutionary algorithms: basic introduction. GECCO (Companion) 2018: 448-468 - [c36]Gisele Lobo Pappa, Michael T. M. Emmerich, Ana L. C. Bazzan, Will N. Browne, Kalyanmoy Deb, Carola Doerr, Marko Durasevic, Michael G. Epitropakis, Saemundur O. Haraldsson, Domagoj Jakobovic, Pascal Kerschke, Krzysztof Krawiec, Per Kristian Lehre, Xiaodong Li, Andrei Lissovoi, Pekka Malo, Luis Martí, Yi Mei, Juan Julián Merelo Guervós, Julian F. Miller, Alberto Moraglio, Antonio J. Nebro, Su Nguyen, Gabriela Ochoa, Pietro S. Oliveto, Stjepan Picek, Nelishia Pillay, Mike Preuss, Marc Schoenauer, Roman Senkerik, Ankur Sinha, Ofer M. Shir, Dirk Sudholt, L. Darrell Whitley, Mark Wineberg, John R. Woodward, Mengjie Zhang:
Tutorials at PPSN 2018. PPSN (2) 2018: 477-489 - [r1]Per Kristian Lehre, Pietro S. Oliveto:
Theoretical Analysis of Stochastic Search Algorithms. Handbook of Heuristics 2018: 849-884 - 2017
- [c33]Per Kristian Lehre, Pietro S. Oliveto:
Runtime analysis of population-based evolutionary algorithms: introductory tutorial at GECCO 2017. GECCO (Companion) 2017: 414-434 - [i3]Per Kristian Lehre, Pietro S. Oliveto:
Theoretical Analysis of Stochastic Search Algorithms. CoRR abs/1709.00890 (2017) - 2016
- [c29]Per Kristian Lehre, Pietro S. Oliveto:
Runtime Analysis of Population-based Evolutionary Algorithms. GECCO (Companion) 2016: 435-462 - [c28]Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton:
Escaping Local Optima with Diversity Mechanisms and Crossover. GECCO 2016: 645-652 - [c26]Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton:
Emergence of Diversity and Its Benefits for Crossover in Genetic Algorithms. PPSN 2016: 890-900 - [c25]Carola Doerr, Nicolas Bredèche, Enrique Alba, Thomas Bartz-Beielstein, Dimo Brockhoff, Benjamin Doerr, Gusz Eiben, Michael G. Epitropakis, Carlos M. Fonseca, Andreia P. Guerreiro, Evert Haasdijk, Jacqueline Heinerman, Julien Hubert, Per Kristian Lehre, Luigi Malagò, Juan Julián Merelo Guervós, Julian Francis Miller, Boris Naujoks, Pietro S. Oliveto, Stjepan Picek, Nelishia Pillay, Mike Preuss, Patricia Ryser-Welch, Giovanni Squillero, Jörg Stork, Dirk Sudholt, Alberto Paolo Tonda, L. Darrell Whitley, Martin Zaefferer:
Tutorials at PPSN 2016. PPSN 2016: 1012-1022 - [i2]Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton:
Escaping Local Optima using Crossover with Emergent or Reinforced Diversity. CoRR abs/1608.03123 (2016) - 2015
- [c24]Per Kristian Lehre, Pietro S. Oliveto:
Runtime Analysis of Evolutionary Algorithms: Basic Introduction. GECCO (Companion) 2015: 121-136 - 2014
- [c21]Per Kristian Lehre, Pietro S. Oliveto:
Runtime analysis of evolutionary algorithms: basic introduction. GECCO (Companion) 2014: 459-486 - 2013
- [c18]Per Kristian Lehre, Pietro S. Oliveto:
Runtime analysis of evolutionary algorithms: basic introduction. GECCO (Companion) 2013: 469-498 - 2010
- [c10]Timo Kötzing, Per Kristian Lehre, Frank Neumann, Pietro S. Oliveto:
Ant colony optimization and the minimum cut problem. GECCO 2010: 1393-1400 - [c9]Stefan Kratsch, Per Kristian Lehre, Frank Neumann, Pietro Simone Oliveto:
Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation. PPSN (1) 2010: 204-213 - 2009
- [c8]Pietro S. Oliveto, Per Kristian Lehre, Frank Neumann:
Theoretical analysis of rank-based mutation - combining exploration and exploitation. IEEE Congress on Evolutionary Computation 2009: 1455-1462
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 2023-09-28 02:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint