Modeling the Performance of Evolutionary Algorithms on the Root Identification Problem: A Case Study with PBIL and CHC Algorithms | Citedby Results | Evolutionary Computation | MIT Press

Skip to Main Content

Skip Nav Destination

Modeling the Performance of Evolutionary Algorithms on the Root Identification Problem: A Case Study with PBIL and CHC Algorithms

Evolutionary Computation (2011) 19 (1): 107–135.

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

Implicit memory-based technique in solving dynamic scheduling problems through Response Surface Methodology – Part I

Manuel Blanco Abello
Zbigniew Michalewicz

International Journal of Intelligent Computing and Cybernetics (2014) 7 (2): 114.

Conflict-based pruning of a solution space within a constructive geometric constraint solver

E. Yeguas
M. J. Marín-Jiménez
R. Muñoz-Salinas
R. Medina-Carnicer

Applied Intelligence (2014) 41 (3): 897.

Implicit memory-based technique in solving dynamic scheduling problems through Response Surface Methodology – Part II

Manuel Blanco Abello
Zbigniew Michalewicz

International Journal of Intelligent Computing and Cybernetics (2014) 7 (2): 143.

Automatic parameter tuning for Evolutionary Algorithms using a Bayesian Case-Based Reasoning system

E. Yeguas
M.V. Luzón
R. Pavón
R. Laza
G. Arroyo
F. Díaz

Applied Soft Computing (2014) 18: 185.

Example-based procedural modelling by geometric constraint solving

Enrique Yeguas
Rafael Muñoz-Salinas
Rafael Medina-Carnicer

Multimedia Tools and Applications (2012) 60 (1): 1.