Analysis of genetic programming runs

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@InProceedings{LiCieWork04,

• author = "Vic Ciesielski and Xiang Li",
• title = "Analysis of genetic programming runs",
• booktitle = "Proceedings of The Second Asian-Pacific Workshop on Genetic Programming",
• year = "2004",
• editor = "R I Mckay and Sung-Bae Cho",
• address = "Cairns, Australia",
• month = "6-7 " # dec,
• keywords = "genetic algorithms, genetic programming, analysis of runs",
• URL = "http://goanna.cs.rmit.edu.au/~xiali/pub/ai04.vc.pdf",
• size = "15 pages",
• abstract = "We have analysed runs of 12 different genetic programming problems. Some of the problems are the `toy' problems used in generic programming research and some are significant real world applications. We have generated log files of the runs and looked for recurring and unusual patterns and whether there are any differences between the toy problems and the real world problems. The major finding is that some programs are being evaluated many times. In the real-world problems 30-78per cent of the time was spent on reevaluating programs that had already been evaluated. For problems where the evaluation function is expensive significant savings are possible if evaluated programs are cached. A surprising finding was that, for two of the real world problems, a very large number of the evaluations were of 1-node programs.",
• notes = "broken http://sc.snu.ac.kr/~aspgp/aspgp04/programme.html",

}

Genetic Programming entries for Victor Ciesielski Xiang Li

Citations