Author of the publication

Strongly typed genetic programming in evolving cooperation strategies

, , , and . Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95), page 271--278. Pittsburgh, PA, USA, Morgan Kaufmann, (15-19 July 1995)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Random Search versus Genetic Programming as Engines for Collective Adaptation.. Evolutionary Programming, volume 1447 of Lecture Notes in Computer Science, page 683-692. Springer, (1998)Collective memory search.. SAC, page 217-222. ACM, (1997)Evolving Behavioral Strategies in Predators and Prey, and . Adaptation and Learning in Multiagent Systems, Springer Verlag, Berlin, Germany, (1995)A Comparision of Random Search versus Genetic Programming as Engines for Collective Adaptation. Evolutionary Programming VII: Proceedings of the Seventh Annual Conference on Evolutionary Programming, volume 1447 of LNCS, page 683--692. Mission Valley Marriott, San Diego, California, USA, Springer-Verlag, (25-27 March 1998)Competitive Computational Agent Society. Late Breaking Papers at the 1997 Genetic Programming Conference, page 293. Stanford University, CA, USA, Stanford Bookstore, (13--16 July 1997)Crossover Operators for Evolving A Team, and . Genetic Programming 1997: Proceedings of the Second Annual Conference, page 162--167. Stanford University, CA, USA, Morgan Kaufmann, (13-16 July 1997)Evolving Cooperation Strategies., , and . ICMAS, page 450. The MIT Press, (1995)Depth-Fair Crossover in Genetic Programming., and . SAC, page 319-323. ACM, (1999)Avoiding Two-bit Crossovers in Genetic Programming, and . Proceedings of the 1999 ACM Symposium on Applied Computing, page 319--323. ACM Press, (1999)Distributed Collective Adaptation Applied to a Hard Combinatorial Optimization Problem. Proceedings of the 1999 ACM Symposium on Applied Computing, page 339--343. ACM Press, (1999)