Solving Approximation Problems by Ant Colony Programming

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

@InProceedings{boryczka:2002:gecco:lbp,

• title = "Solving Approximation Problems by Ant Colony Programming",
• author = "Mariusz Boryczka and Zbigniew J. Czech",
• booktitle = "Late Breaking Papers at the Genetic and Evolutionary Computation Conference ({GECCO-2002})",
• editor = "Erick Cant{\'u}-Paz",
• year = "2002",
• month = jul,
• pages = "39--46",
• address = "New York, NY",
• publisher = "AAAI",
• publisher_address = "445 Burgess Drive, Menlo Park, CA 94025",
• keywords = "genetic algorithms, genetic programming, automatic programming, ant colony programming, approximation problems",
• URL = "http://www-zo.iinf.polsl.gliwice.pl/pub/zjc/bc02.ps.Z",
• size = "8 pages",
• abstract = "A method of automatic programming, called genetic programming, assumes that the desired program is found by using a genetic algorithm....",
• notes = "Late Breaking Papers, {GECCO-2002}. A joint meeting of the eleventh International Conference on Genetic Algorithms ({ICGA-2002}) and the seventh Annual Genetic Programming Conference ({GP-2002}) part of cantu-paz:2002:GECCO:lbp",

}

Genetic Programming entries for Mariusz Boryczka Zbigniew J Czech

Citations