Models of Performance of Evolutionary Program Induction Algorithms Based on Indicators of Problem Difficulty | Citedby Results | Evolutionary Computation | MIT Press

Skip to Main Content

Skip Nav Destination

Models of Performance of Evolutionary Program Induction Algorithms Based on Indicators of Problem Difficulty

Evolutionary Computation (2013) 21 (4): 533–560.

This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.

Genetic programming performance prediction and its application for symbolic regression problems

Samaneh Sadat Mousavi Astarabadi
Mohammad Mehdi Ebadzadeh

Information Sciences (2019) 502: 418.

Inference of Regular Expressions for Text Extraction from Examples

Alberto Bartoli
Andrea De Lorenzo
Eric Medvet
Fabiano Tarlao

IEEE Transactions on Knowledge and Data Engineering (2016) 28 (5): 1217.

Prediction of expected performance for a genetic programming classifier

Yuliana Martínez
Leonardo Trujillo
Pierrick Legrand
Edgar Galván-López

Genetic Programming and Evolvable Machines (2016) 17 (4): 409.

Predicting the effectiveness of pattern-based entity extractor inference

Alberto Bartoli
Andrea De Lorenzo
Eric Medvet
Fabiano Tarlao

Applied Soft Computing (2016) 46: 398.

Algorithm selection for black-box continuous optimization problems: A survey on methods and challenges

Mario A. Muñoz
Yuan Sun
Michael Kirley
Saman K. Halgamuge

Information Sciences (2015) 317: 224.

Wind speed forecasting using a portfolio of forecasters

Mario Graff
Rafael Peña
Aurelio Medina
Hugo Jair Escalante

Renewable Energy (2014) 68: 550.

Models of performance of time series forecasters

Mario Graff
Hugo Jair Escalante
Jaime Cerda-Jacobo
Alberto Avalos Gonzalez

Neurocomputing (2013) 122: 375.