Using quotient graphs to model neutrality in evolutionary search
暂无分享,去创建一个
[1] Julian F. Miller,et al. Genetic and Evolutionary Computation — GECCO 2003 , 2003, Lecture Notes in Computer Science.
[2] Terry Jones,et al. Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms , 1995, ICGA.
[3] Leonardo Vanneschi,et al. A Study of Fitness Distance Correlation as a Difficulty Measure in Genetic Programming , 2005, Evolutionary Computation.
[4] Tim Jones. Evolutionary Algorithms, Fitness Landscapes and Search , 1995 .
[5] Edwin R. Hancock,et al. Eigenspaces for Graphs , 2002, Int. J. Image Graph..
[6] Alden H. Wright,et al. EA models and population fixed-points versus mutation rates for functions of unitation , 2005, GECCO '05.
[7] Bart Naudts,et al. A comparison of predictive measures of problem difficulty in evolutionary algorithms , 2000, IEEE Trans. Evol. Comput..
[8] W. J. Thron,et al. Encyclopedia of Mathematics and its Applications. , 1982 .
[9] Lee Altenberg,et al. Fitness Distance Correlation Analysis: An Instructive Counterexample , 1997, ICGA.
[10] Riccardo Poli,et al. On the effects of bit-wise neutrality on fitness distance correlation, phenotypic mutation rates and problem hardness , 2007, FOGA'07.
[11] Chris D. Godsil,et al. ALGEBRAIC COMBINATORICS , 2013 .
[12] Peter F. Stadler,et al. Aggregation of variables and system decomposition: Applications to fitness landscape analysis , 2004, Theory in Biosciences.
[13] Terence Soule,et al. Redundant genes and the evolution of robustness , 2006, GECCO '06.