%0 Report %1 HPL-2001-327 %A Kirshenbaum, Evan %D 2001 %K algorithms, genetic programming %N HPL-2001-327 %T Iteration Over Vectors in Genetic Programming %U http://www.kirshenbaum.net/evan/publications/GECCO-2001-tr.pdf %X genetic programming with bounded iteration constructs, which allow the computational complexity of the solution to be an emergent property. It is shown that such operators render the even-6-parity problem trivial, and the results of experiments with other, harder, problems that require O(n) complexity are shown. This method is contrasted with Automatically Defined Iterators.

@techreport{HPL-2001-327, abstract = {genetic programming with bounded iteration constructs, which allow the computational complexity of the solution to be an emergent property. It is shown that such operators render the even-6-parity problem trivial, and the results of experiments with other, harder, problems that require O(n) complexity are shown. This method is contrasted with Automatically Defined Iterators.}, added-at = {2008-06-19T17:35:00.000+0200}, author = {Kirshenbaum, Evan}, biburl = {https://www.bibsonomy.org/bibtex/2be98c725fe5ac526a548460ec3d586d4/brazovayeye}, institution = {HP Laboratories}, interhash = {dcb994401d9f8eb098ee12beddb42d43}, intrahash = {be98c725fe5ac526a548460ec3d586d4}, keywords = {algorithms, genetic programming}, month = {December 17}, number = {HPL-2001-327}, size = {pages}, timestamp = {2008-06-19T17:43:25.000+0200}, title = {Iteration Over Vectors in Genetic Programming}, type = {Technical Report}, url = {http://www.kirshenbaum.net/evan/publications/GECCO-2001-tr.pdf}, year = 2001 }