BibSonomy :: user  :: brazovayeye ::

bookmarks

publications

(7)   

• A Study of Fitness Distance Correlation as a Difficulty Measure in Genetic Programming
  Marco Tomassini and Leonardo Vanneschi and Philippe Collard and Manuel Clergue Evolutionary Computation13(2):213--239Summer2005.
  to distance programming, fitness difficulty, program genetic problem correlation algorithms, landscapes, by brazovayeye and 1 other person on Jun 19, 2008, 5:46 PM
  URL | BibTeX | spam 
• Genetic programming: optimal population sizes for varying complexity problems
  Alan Piszcz and Terence Soule GECCO 2006: Proceedings of the 8th annual conference on Genetic and evolutionary computation, 1, page953--954. Seattle, Washington, USA, ACM Press, 8-12 July2006.
  to Poster, binary optimal, programming: problem sizing MAX tree difficulty, genetic problem, binomial-3, algorithms, sizing, population by brazovayeye and 1 other person on Jun 19, 2008, 5:46 PM
  URL | BibTeX | spam 
• ORDERTREE: a new test problem for genetic programming
  Tuan-Hao Hoang and Nguyen Xuan Hoai and Nguyen Thi Hien and R I McKay and Daryl Essam GECCO 2006: Proceedings of the 8th annual conference on Genetic and evolutionary computation, 1, page807--814. Seattle, Washington, USA, ACM Press, 8-12 July2006.
  to problems, theory languages, problem strategies, and graph tree benchmark programming, difficulty, search genetic algorithms, by brazovayeye and 1 other person on Jun 19, 2008, 5:35 PM
  URL | BibTeX | spam 
• Towards identifying populations that increase the likelihood of success in genetic programming
  Jason M. Daida GECCO 2005: Proceedings of the 2005 conference on Genetic and evolutionary computation, 2, page1627--1634. Washington DC, USA, ACM Press, 25-29 June2005.
  to building experimentation, theory problem selection methods, populations, programming programming, difficulty, genetic initial binomial-3, performance, algorithms, blocks, dynamics, population by brazovayeye and 1 other person on Jun 19, 2008, 5:35 PM
  URL | BibTeX | spam 
• What Makes a Problem GP-Hard? A Look at How Structure Affects Content
  Jason M. Daida Genetic Programming Theory and Practice, chapter 7, Kluwer, (2003)
  to problems tree structures, programming, test difficulty, genetic GP-hard, GP problem algorithms, theory, by brazovayeye on Jun 19, 2008, 5:35 PM
  BibTeX | spam 
• What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming
  Jason M. Daida and Robert R. Bertram and Stephen A. Stanhope and Jonathan C. Khoo and Shahbaz A. Chaudhary and Omer A. Chaudhri and John A. Polito II Genetic Programming and Evolvable Machines2(2):165--191June2001.
  to problems, programming, test fitness difficulty, genetic GP theory problem algorithms, landscapes, by brazovayeye on Jun 19, 2008, 5:35 PM
  BibTeX | spam 
• Fitness Distance Correlation And Problem Difficulty For Genetic Programming
  Manuel Clergue and Philippe Collard and Marco Tomassini and Leonardo Vanneschi GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, page724--732. New York, Morgan Kaufmann Publishers, 9-13 July2002.
  to functions correlation, fitness trees, problem trap distance programming, difficulty, genetic royal genotypes, algorithms, between by brazovayeye and 1 other person on Jun 19, 2008, 5:35 PM
  URL | BibTeX | spam