| R. Heckendorn and D. Whitley. Predicting epistasis directly from mathematical models. In Evolutionary Computation '99. MIT-press, 1999. |
....in a string s or schema h which are respectively set to or zero. Concretely, h) fi 2 L j h i = g 0(s) fi 2 L j s i = 0g: Using the previous de nitions and the schema h = 002 for 0 = f0; 1; 2g[ f g, we get the following sets: h) f0g and 0(h) f1; 2g. Heckendorn et al. [3] prove the Hyperplane Averaging Theorem for binary alphabets. A trivial generalization yields the same theorem for multary alphabets. Theorem2 Hyperplane Averaging Theorem for Multary Alphabets. Let h 2 ( f g) L be a schema with (h) 6= It holds that 1 jhj X x2h f(x) X j: ....
R. Heckendorn and D. Whitley. Predicting epistasis directly from mathematical models. In Evolutionary Computation '99. MIT-press, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC