%0 Conference Paper %1 boryczka:2002:gecco:lbp %A Boryczka, Mariusz %A Czech, Zbigniew J. %B Late Breaking Papers at the Genetic and Evolutionary Computation Conference (GECCO-2002) %C New York, NY %D 2002 %E Cantú-Paz, Erick %I AAAI %K algorithms, ant approximation automatic colony genetic problems programming, %P 39--46 %T Solving Approximation Problems by Ant Colony Programming %U http://www-zo.iinf.polsl.gliwice.pl/pub/zjc/bc02.ps.Z %X A method of automatic programming, called genetic programming, assumes that the desired program is found by using a genetic algorithm....

@inproceedings{boryczka:2002:gecco:lbp, abstract = {A method of automatic programming, called genetic programming, assumes that the desired program is found by using a genetic algorithm....}, added-at = {2008-06-19T17:35:00.000+0200}, address = {New York, NY}, author = {Boryczka, Mariusz and Czech, Zbigniew J.}, biburl = {https://www.bibsonomy.org/bibtex/24e355687f22405011af7bf1ef05d2a85/brazovayeye}, booktitle = {Late Breaking Papers at the Genetic and Evolutionary Computation Conference ({GECCO-2002})}, editor = {Cant{\'u}-Paz, Erick}, interhash = {1df473d732db6804ae493f161b677355}, intrahash = {4e355687f22405011af7bf1ef05d2a85}, keywords = {algorithms, ant approximation automatic colony genetic problems programming,}, month = {July}, 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}, pages = {39--46}, publisher = {AAAI}, publisher_address = {445 Burgess Drive, Menlo Park, CA 94025}, size = {8 pages}, timestamp = {2008-06-19T17:36:47.000+0200}, title = {Solving Approximation Problems by Ant Colony Programming}, url = {http://www-zo.iinf.polsl.gliwice.pl/pub/zjc/bc02.ps.Z}, year = 2002 }