Information Technology Reference
In-Depth Information
158. Whitley, D., Mathias, K., Fitzhorn, P.: Delta coding: An iterative search strategy
for genetic algorithms. In: Belew, R., Booker, L. (eds.) Proceedings of the Fourth
International Conference on Genetic Algorithms, pp. 77-84. Morgan Kaufman
Publishers Inc., San Francisco (1991)
159. Whitley, D.L., Yoo, N.: Modeling simple genetic algorithms for permutation prob-
lems. In: Whitley, L.D., Vose, M.D. (eds.) Foundations of Genetic Algorithms III,
pp. 163-184. Morgan Kaufmann Publishers Inc., San Francisco (1995)
160. Witt, C.: Runtime analysis of the (
μ
+1) EA on simple pseudo boolean functions.
Evolutionary Computation 14(1), 65-86 (2006)
161. Wolpert, D.H., Macready, W.G.: No free lunch theorems for search. Technical
report, Santa Fe, NM (1995)
162. Yao, X., Liu, Y.: Fast evolution strategies. In: Angeline, P.J., Reynolds, R.G.,
McDonnell, J.R., Eberhart, R. (eds.) Evolutionary Programming VI, pp. 151-
161. Springer, Berlin (1997)
163. Yao, X., Liu, Y., Liang, K.-H., Lin, G.: Fast evolutionary algorithms. Springer,
Berlin (2003)
164. Yuan, B., Gallagher, M.: On the importance of diversity maintenance in estima-
tion of distribution algorithms. In: Proceedings of the 7th conference on genetic
and evolutionary computation - GECCO, pp. 719-726. ACM Press, New York
(2005)