An Extension of Geiringer's Theorem for a Wide Class of Evolutionary Search Algorithms | Citedby Results | Evolutionary Computation | MIT Press

Skip to Main Content

Skip Nav Destination

An Extension of Geiringer's Theorem for a Wide Class of Evolutionary Search Algorithms

Evolutionary Computation (2006) 14 (1): 87–118.

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

A version of Geiringer‐like theorem for decision making in the environments with randomness and incomplete information

Boris Mitavskiy
Jonathan Rowe
Chris Cannings

International Journal of Intelligent Computing and Cybernetics (2012) 5 (1): 36.

A New Method for Modeling the Behavior of Finite Population Evolutionary Algorithms

Tatsuya Motoki

Evolutionary Computation (2010) 18 (3): 451.

Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links

Boris Mitavskiy
Jonathan Rowe
Chris Cannings

International Journal of Intelligent Computing and Cybernetics (2009) 2 (2): 243.

Estimating the Ratios of the Stationary Distribution Values for Markov Chains Modeling Evolutionary Algorithms

Boris Mitavskiy
Chris Cannings

Evolutionary Computation (2009) 17 (3): 343.

Understanding the Biases of Generalised Recombination: Part II

Riccardo Poli
Christopher R. Stephens

Evolutionary Computation (2007) 15 (1): 95.