logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Back
P

Pietro S. Oliveto

institut polytechnique de paris

30H-index
123Paper Count
2.6KCitation Count
Published Papers 10
Publication Date
logo
Selection hyper-heuristics can automatically adjust the learning period to optimally solve pseudo-Boolean problems
errArtificial Intelligence
IF4.6
err2026-08-01
err0
PREAI
errDoerr, Benjamin; Oliveto, Pietro S.; Warwicker, John Alasdair
errShare
errSave
(1+1) genetic programming with functionally complete instruction sets can evolve Boolean conjunctions and disjunctions with arbitrarily small error
errartificial intelligence review
IF4.6
err2023-06-01
err1
errOAAI
errDoerr, Benjamin; Lissovoi, Andrei; Oliveto, Pietro S.
errShare
errSave
When move acceptance selection hyper-heuristics outperform Metropolis and elitist evolutionary algorithms and when not
errartificial intelligence review
IF4.6
err2023-01-01
err12
errOAAI
errLissovoi, Andrei; Oliveto, Pietro S.; Warwicker, John Alasdair
errShare
errSave
On the impact of the performance metric on efficient algorithm configuration
errartificial intelligence review
IF4.6
err2022-02-01
err3
errOAAI
errHall, George T.; Oliveto, Pietro S.; Sudholt, Dirk
errShare
errSave
Fast Immune System-Inspired Hypermutation Operators for Combinatorial Optimization
errIEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
IF12
err2021-10-01
err15
errOAAI
errCorus, Dogan; Oliveto, Pietro S.; Yazdani, Donya
errShare
errSave
Guest Editorial Special Issue on Theoretical Foundations of Evolutionary Computation
errIEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
IF12
err2020-12-01
err0
errOAAI
errOliveto, Pietro S.; Auger, Anne; Chicano, Francisco; Fonseca, Carlos M.
errShare
errSave
Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem
errartificial intelligence review
IF4.6
err2019-09-01
err24
errOAAI
errCorus, Dogan; Oliveto, Pietro S.; Yazdani, Donya
errShare
errSave
Standard Steady State Genetic Algorithms Can Hillclimb Faster Than Mutation-Only Evolutionary Algorithms
errIEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
IF12
err2018-10-01
err88
errOAAI
errCorus, Dogan; Oliveto, Pietro S.
errShare
errSave
Escaping Local Optima Using Crossover With Emergent Diversity
errIEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
IF12
err2018-06-01
err111
errOAAI
errDang, Duc-Cuong; Friedrich, Tobias; Koetzing, Timo; Krejca, Martin S.; Lehre, Per Kristian; Oliveto, Pietro S.; Sudholt, Dirk; Sutton, Andrew M.
errShare
errSave
Analysis of the (1+1)-EA for Finding Approximate Solutions to Vertex Cover Problems
errIEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
IF12
err2009-10-01
err75
errOAAI
errOliveto, Pietro S.; He, Jun; Yao, Xin
errShare
errSave

Research Directions

The data has not been retrieved yet.
Co-authors
Cooperation Journals
X
Xin Yao
H-index: 116 · Papers: 1.5K
B
Benjamin Doerr
H-index: 40 · Papers: 326
C
Carlos M. Fonseca
H-index: 40 · Papers: 134
T
Tobias Friedrich
H-index: 38 · Papers: 395
D
Dirk Sudholt
H-index: 37 · Papers: 213
View more