Author of the publication

Combining Drift Analysis and Generalized Schema Theory to Design Efficient Hybrid and/or Mixed Strategy EAs

, and . CoRR, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Some results about the Markov chains associated to GPs and general EAs., and . Theor. Comput. Sci., 361 (1): 72-110 (2006)A Version of Geiringer-like Theorem for Decision Making in the Environments with Randomness and Incomplete Information, , and . CoRR, (2011)An improvement of the "quotient construction" method and further asymptotic results on the stationary distributions of the Markov chains modeling evolutionary algorithms., and . IEEE Congress on Evolutionary Computation, page 2606-2613. IEEE, (2007)Estimating the Ratios of the Stationary Distribution Values for Markov Chains Modeling Evolutionary Algorithms., and . Evol. Comput., 17 (3): 343-377 (2009)Crossover Invariant Subsets of the Search Space for Evolutionary Algorithms.. Evol. Comput., 12 (1): 19-46 (2004)A further generalization of the finite-population geiringer-like theorem for pomdps to allow recombination overarbitrary set covers., and . FOGA, page 133-146. ACM, (2013)Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links., , and . Int. J. Intell. Comput. Cybern., 2 (2): 243-284 (2009)NP-Completeness of Deciding Binary Genetic Encodability., and . FOGA, volume 3469 of Lecture Notes in Computer Science, page 58-74. Springer, (2005)A Schema-Based Version of Geiringer's Theorem for Nonlinear Genetic Programming with Homologous Crossover., and . FOGA, volume 3469 of Lecture Notes in Computer Science, page 156-175. Springer, (2005)Some Results about the Markov Chains Associated to GPs and to General EAs, and . Theoretical Computer Science, 361 (1): 72--110 (28 August 2006)