A study on allelic recombination

2003 Congress on Evolutionary Computation, CEC 2003 - Proceedings

Volumn 2, Issue , 2003, Pages 1406-1413

  Cotta, Carlos ^a  

^a UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; EVOLUTIONARY ALGORITHMS;

ALGORITHMIC ASPECTS; FEATURE SETS; RECOMBINATION PROCESS; SEARCH SPACES; SYNTACTIC PROPERTIES;

INFORMATION USE;

EID: 17044395655     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2003.1299835     Document Type: Conference Paper

References (11)

1. G. Cotta and J. Muruzabal. Towards a more efficient evolutionary induction of bayesian networks. In J.J. Merelo et al., editors, Parallel Problem Solving from Mature VII, volume 2439 of Lecture Notes in Computer Science, pages 730-739. Springer-Verlag, Berlin Heidelberg, 2002.
2. C. Cotta and J.M, Troya. Information processing in transmitting recombination. Applied Mathematics Letters. In Press.
3. C. Cotta and J.M. Troya. On the influence of the representation granularity in heuristic forma recombination. In J. Carroll et al., editors, ACMSymposium on Applied Com.puting 2000, pages 433-439. ACM Press, 2000.
4. G. Cotta and J.M. Troya. Using dynastic exploring recombination to promote diversity in genetic search. In M. Schoenauer et al., editors. Parallel Problem Salving from Nature VI, volume 1917 of Lecture Notes in Computer Science, pages 325334. Springer-Verlag, Berlin, 2000.
5. C. Cotta and J.M. Troya. Analyzing directed acyclic graph recombination. In B. Reusch., editor, Computational Intelligence: Theory and Applications, volume 2206 of Lecture Notes in Computer Science, pages 739-748. Springer-Verlag, Berlin Heidelberg, 2001.
6. M.R. Garey and D.S Johnson. Computers and Intractability: A Guide to the Theory of NP- Completeness. Freeman and Co., San Francisco CA, 1979.
7. K. Mathias and D. Whitley. Genetic operators, the fitness landscape and the traveling salesman problem. In R. Manner and B. Manderick, editors, Parallel Problem Solving From Nature II, pages 259-268. Elsevier, Amsterdam, 1992.
8. N.J. Radcliffe. Equivalence class analysis of genetic algorithms. Complex Systems, 5:183-205, 1991.
9. N.J. Radcliffe. Genetic set recombination. In D. Whitley, editor, Foundations of Genetic Algorithms II, pages 203-219, San Mateo CA, 1992. Morgan Kauffman.
10. N.J. Radcliffe. The algebra of genetic algorithms. Annals of Mathematics and Artificial Intelligence, 10:339-384, 1994.
11. T. Starkweather, S. McDaniel, K. Mathias, D. Whitley, and C. Whitley. A comparison of genetic sequencing operators. In R.K. Belew and L.B. Booker, editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 69-76, San Mateo CA, 1991. Morgan Kauffman.