Zobrazeno 1 - 10
of 167
pro vyhledávání: '"Whitley, L. Darrell"'
Bit-flip mutation is a common mutation operator for evolutionary algorithms applied to optimize functions over binary strings. In this paper, we develop results from the theory of landscapes and Krawtchouk polynomials to exactly compute the probabili
Externí odkaz:
http://arxiv.org/abs/1309.2979
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Theoretical Computer Science 2011 412(43):6002-6019
Publikováno v:
RIUMA. Repositorio Institucional de la Universidad de Málaga
instname
Evolutionary Computation
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
instname
Evolutionary Computation
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
An optimal recombination operator for two parent solutions provides the best solution among those that take the value for each variable from one of the parents (gene transmission property). If the solutions are bit strings, the offspring of an optima
Publikováno v:
Evolutionary Computation. Fall2016, Vol. 24 Issue 3, p491-519. 29p. 3 Charts.
Autor:
Chicano, Francisco1 chicano@lcc.uma.es, Whitley, L. Darrell2 whitley@cs.colostate.edu, Alba, Enrique1 eat@lcc.uma.es
Publikováno v:
Evolutionary Computation. Winter2011, Vol. 19 Issue 4, p597-637. 41p. 12 Diagrams, 6 Charts.
Autor:
Corruccini, Robert S., Whitley, L. Darrell, Kaul, Samvit S., Flander, Louisa B., Morrow, Carol A.
Publikováno v:
Human Biology, 1985 May 01. 57(2), 151-161.
Externí odkaz:
https://www.jstor.org/stable/41464746
Publikováno v:
RIUMA. Repositorio Institucional de la Universidad de Málaga
instname
instname
Chicano, F., Whitley D., & Alba E. (2012). Exact computation of the expectation curves for uniform crossover. (Soule, T., & Moore J. H., Ed.).Genetic and Evolutionary Computation Conference, GECCO'12, Philadelphia, PA, USA, July 7-11, 2012. 1301–13
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::4b8fd6c46758ebaf2dbb6a65fc12819a
http://hdl.handle.net/10630/8203
http://hdl.handle.net/10630/8203
Publikováno v:
RIUMA. Repositorio Institucional de la Universidad de Málaga
instname
instname
There exist local search landscapes where the evaluation function is an eigenfunction of the graph Laplacian that corresponds to the neighborhood structure of the search space. Problems that dis- play this structure are called “Elementary Landscape
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=RECOLECTA___::5638997d22d8ae1a620c2fcdee5cc976
http://hdl.handle.net/10630/7381
http://hdl.handle.net/10630/7381
Publikováno v:
RIUMA. Repositorio Institucional de la Universidad de Málaga
instname
instname
Whitley, D., & Chicano F. (2012). Quasi-elementary Landscapes and Superpositions of Elementary Landscapes. (Hamadi, Y., & Schoenauer M., Ed.).Learning and Intelligent Optimization - 6th International Conference, LION 6, Paris, France, January 16-20,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::3ec14b1b1744e0f0e588ee534f580e2c
http://hdl.handle.net/10630/8200
http://hdl.handle.net/10630/8200