| J. J. Merelo, J. Carpio, P. Castillo, V. M. Rivas, and G. Romero. Finding a needel in a haystack using hints and evolutionary computation: the case of genetic mastermind. In Late breaking papers at the GECCO99, pages 184-192, 1999. |
No context found.
J. J. Merelo, J. Carpio, P. Castillo, V. M. Rivas, and G. Romero. Finding a needel in a haystack using hints and evolutionary computation: the case of genetic mastermind. In Late breaking papers at the GECCO99, pages 184-192, 1999.
....to adapt this problem to EO: the new mutation operators were given the same rights as the native mutation operators, which could not be used in this case. This application is available also from http: geneura.ugr.es pedro GProp. htm. Genetic Mastermind In the case of the game of Mastermind [7], a GA was programmed to nd the hidden combination, improving results obtained in previous implementations.The subject of evolution were the mastermind solutions themselves. The genetic operators were also adapted to these objects: a permutation and a creep operator, which substituted a number ....
J. J. Merelo; J. Carpio; P. Castillo; V. M. Rivas; G. Romero. Finding a needel in a haystack using hints and evolutionary computation: the case of genetic mastermind. In Annie S. Wu Scott Brave, editor, Late breaking papers at the GECCO99, pages 184-192, 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