메뉴 건너뛰기




Volumn , Issue , 2009, Pages 285-292

Self modifying cartesian genetic programming: Parity

Author keywords

[No Author keywords available]

Indexed keywords

CARTESIAN GENETIC PROGRAMMING; EVEN-PARITY; EVEN-PARITY PROBLEMS; GENERAL SOLUTIONS; PARITY PROBLEMS; PRIMITIVE FUNCTION; PROBLEM SIZE;

EID: 70449863493     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2009.4982960     Document Type: Conference Paper
Times cited : (30)

References (19)
  • 3
    • 11244315715 scopus 로고    scopus 로고
    • Ontogenetic programming
    • J. R. Koza, D. E. Goldberg, D. B. Fogel, and R. L. Riolo, Eds. Stanford University, CA, USA: MIT Press
    • L. Spector and K. Stoffel, "Ontogenetic programming," in Genetic Programming 1996: Proceedings of the First Annual Conference, J. R. Koza, D. E. Goldberg, D. B. Fogel, and R. L. Riolo, Eds. Stanford University, CA, USA: MIT Press, 28-31 1996, pp. 394-399.
    • (1996) Genetic Programming 1996: Proceedings of the First Annual Conference , vol.28-31 , pp. 394-399
    • Spector, L.1    Stoffel, K.2
  • 5
    • 84957014403 scopus 로고    scopus 로고
    • A developmental method for growing graphs and circuits
    • A. M. Tyrrell, P. C. Haddow, and J. Torresen, Eds., Springer
    • J. F. Miller and P. Thomson, "A developmental method for growing graphs and circuits." in ICES, ser. Lecture Notes in Computer Science, A. M. Tyrrell, P. C. Haddow, and J. Torresen, Eds., vol.2606. Springer, 2003, pp. 93-104.
    • (2003) ICES, ser. Lecture Notes in Computer Science , vol.2606 , pp. 93-104
    • Miller, J.F.1    Thomson, P.2
  • 10
    • 14844324505 scopus 로고    scopus 로고
    • Solving high-order boolean parity problems with smooth uniform crossover, sub-machine code gp and demes
    • R. Poli and J. Page, "Solving high-order boolean parity problems with smooth uniform crossover, sub-machine code gp and demes," Genetic Programming and Evolvable Machines, vol.1, no.1-2, pp. 37-56, 2000.
    • (2000) Genetic Programming and Evolvable Machines , vol.1 , Issue.1-2 , pp. 37-56
    • Poli, R.1    Page, J.2
  • 11
    • 4344589298 scopus 로고    scopus 로고
    • Finding general solutions to the parity problem by evolving machine-language representations
    • J. R. Koza, W. Banzhaf, and et al., Eds. University of Wisconsin, Madison, Wisconsin, USA: Morgan Kaufmann, 22-25 Jul
    • L. Huelsbergen, "Finding general solutions to the parity problem by evolving machine-language representations," in Genetic Programming 1998: Proceedings of the Third Annual Conference, J. R. Koza, W. Banzhaf, and et al., Eds. University of Wisconsin, Madison, Wisconsin, USA: Morgan Kaufmann, 22-25 Jul. 1998, pp. 158-166.
    • (1998) Genetic Programming 1998: Proceedings of the Third Annual Conference , pp. 158-166
    • Huelsbergen, L.1
  • 12
    • 0003220403 scopus 로고    scopus 로고
    • Evolving recursive functions for the even-parity problem using genetic programming
    • P. J. Angeline and K. E. E. Kinnear, Jr., Eds. Cambridge, MA, USA: MIT Press, ch. 11
    • M. L. Wong and K. S. Leung, "Evolving recursive functions for the even-parity problem using genetic programming," in Advances in Genetic Programming 2, P. J. Angeline and K. E. E. Kinnear, Jr., Eds. Cambridge, MA, USA: MIT Press, 1996, ch. 11, pp. 221-240.
    • (1996) Advances in Genetic Programming 2 , pp. 221-240
    • Wong, M.L.1    Leung, K.S.2
  • 13
    • 29844436641 scopus 로고    scopus 로고
    • Evolving recursive programs by using adaptive grammar based genetic programming
    • M. L. Wong and T. Mun, "Evolving recursive programs by using adaptive grammar based genetic programming," Genetic Programming and Evolvable Machines, vol.6, no.4, pp. 421-455, 2005.
    • (2005) Genetic Programming and Evolvable Machines , vol.6 , Issue.4 , pp. 421-455
    • Wong, M.L.1    Mun, T.2
  • 16
    • 84946491745 scopus 로고    scopus 로고
    • Cartesian genetic programming
    • R. Poli and W. Banzhaf, et al., Eds., Springer-Verlag
    • J. F. Miller and P. Thomson, "Cartesian genetic programming," in Proc. of EuroGP 2000, ser. LNCS, R. Poli and W. Banzhaf, et al., Eds., vol.1802. Springer-Verlag, 2000, pp. 121-132.
    • (2000) Proc. of EuroGP 2000, Ser. LNCS , vol.1802 , pp. 121-132
    • Miller, J.F.1    Thomson, P.2
  • 17
    • 84937438417 scopus 로고    scopus 로고
    • "The advantages of landscape neutrality in digital circuit evolution
    • Springer-Verlag
    • V. K. Vassilev and J. F. Miller, "The advantages of landscape neutrality in digital circuit evolution," in Proc. of ICES. Springer-Verlag, 2000, vol.1801, pp. 252-263.
    • (2000) Proc. of ICES , vol.1801 , pp. 252-263
    • Vassilev, V.K.1    Miller, J.F.2
  • 18
    • 84937413225 scopus 로고    scopus 로고
    • Neutrality and the evolvability of boolean function landscape
    • J. F. Miller and M. T. et al., Eds., Springer-Verlag
    • T. Yu and J. Miller, "Neutrality and the evolvability of boolean function landscape," in Proc. of EuroGP 2001, ser. LNCS, J. F. Miller and M. T. et al., Eds., vol.2038. Springer-Verlag, 2001, pp. 204-217.
    • (2001) Proc. of EuroGP 2001 Ser. LNCS , vol.2038 , pp. 204-217
    • Yu, T.1    Miller, J.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.