( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Schema-Theory-Based Extension of Geiringer's Theorem for Linear GP and Varialbe-length GAs under Homologous Crossover.

, , , и . FOGA, стр. 45-62. Morgan Kaufmann, (2002)

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.

Alden Yépez

Alden King

Gabriele Wright

Wright Jacob

Glenn Wright

 

Другие публикации лиц с тем же именем

A Hierarchical Genetic System for Symbolic Function Identification, и . Proceedings of the 24th Symposium on the Interface: Computing Science and Statistics, College Station, Texas, (марта 1992)Genetic Algorithms for Real Parameter Optimization. Foundations of Genetic Algorithms, Morgan Kaufmann, San Francisco, CA, (1991)Exact Results From A Coarse Grained Formulation Of The Dynamics Of Variable-length Genetic Algorithms., , , и . GECCO, стр. 578-585. Morgan Kaufmann, (2002)Finiteness of the Fixed Point Set for the Simple Genetic Algorithm., и . Evol. Comput., 3 (3): 299-309 (1995)Approximate String Matching using Within-word Parallelism.. Softw. Pract. Exp., 24 (4): 337-362 (1994)The computational complexity of N-K fitness functions., , и . IEEE Trans. Evol. Comput., 4 (4): 373-379 (2000)Stability of Vertex Fixed Points and Applications., и . FOGA, стр. 103-113. Morgan Kaufmann, (1994)Efficient Linkage Discovery by Limited Probing., и . GECCO, том 2723 из Lecture Notes in Computer Science, стр. 1003-1014. Springer, (2003)An Estimation of Distribution Algorithm Based on Maximum Entropy., , , , и . GECCO (2), том 3103 из Lecture Notes in Computer Science, стр. 343-354. Springer, (2004)O(k) parallel algorithm for approximate string matching., и . Neural Parallel & Scientific Comp., (1993)