Genetic Network Programming for Automatic Program Generation

Journal of Advanced Computational Intelligence and Intelligent Informatics

Volumn 9, Issue 4, 2005, Pages 430-436

  Mabu, Shingo ^a   Hirasawa, Kotaro ^a   Matsuya, Yuko ^b   Hu, Jinglu ^a  

^a WASEDA UNIVERSITY   (Japan)

^b KYUSHU UNIVERSITY   (Japan)

Author keywords

even n parity problem; evolutionary computation; genetic network programming; memory architecture; mirror symmetry problem

Indexed keywords

DIRECTED GRAPHS; GENETIC ALGORITHMS; MEMORY ARCHITECTURE; MIRRORS;

AUTOMATIC PROGRAMS; COMPUTATION METHODS; DIRECTED GRAPH STRUCTURES; EVEN-N-PARITY PROBLEM; GENETIC NETWORK PROGRAMMING; MIRROR SYMMETRY; MIRROR SYMMETRY PROBLEM; PROGRAM GENERATION; STATIC PROBLEMS; SYMMETRY PROBLEM;

GENETIC PROGRAMMING;

EID: 56749139331     PISSN: 13430130     EISSN: 18838014     Source Type: Journal    
DOI: 10.20965/jaciii.2005.p0430     Document Type: Article

References (16)

1. J. H. Holland, “Adaptation in Natural and Artificial Systems,” University of Michigan Press, 1975, MIT Press, 1992.
2. J. R. Koza, “Genetic Programming: On the Programming of Computers by Means of Natural Selection,” MIT Press, Cambridge, MA, 1992.
3. J. R. Koza, “Genetic Programming II: Automatic Discovery of Reusable Programs,” MIT Press, Cambridge, MA, 1994.
4. D.E. Rumelhart, G.E. Hinton, and R.J. Williams, “Learning Internal Representation by Error Propagation,” Parallel Distributing Processing, Vol.1, MIT Press, 1986.
5. H. Iba, “Evolutionary Computation,” Tokyo University Press, Tokyo, 1999.
6. R. Setiono, “On the solution of the parity problem by a single hidden layer feedforward neural network,” Neurocomputing, Vol.16, pp. 225-235, 1997.
7. D. G. Stock, and J. O. Allen, “How to solve the N-bit parity problem with two hidden units,” Neural Networks, Vol.5, pp. 923-926, 1992.
8. R. Poli, and W. Langdon, “On the Search Properties of Different Crossover Operators in Genetic Programming,” Proc. of Genetic and Evolutionary Computation Conference, 1998.
9. K. Hirasawa, M. Okubo, J. Hu, and J. Murata, “Comparison between Genetic Network Programming and Genetic Programming,” Proc. of the 2001 IEEE Congress on Evolutionary Computation, pp. 1276-1282, 2001.
10. K. Hirasawa, M. Okubo, H. Katagiri, J. Hu, and J. Murata, “Comparison between Genetic Network Programming and Genetic Programming using evolution of ant's behaviors,” Trans. IEE Japan, Vol.122-C, No.6, pp. 1001-1009, 2001.
11. H. Katagiri, K. Hirasawa, J. Hu, and J. Murata, “Network Structure Oriented Evolutionary Model -Genetic Network Programming- and Its Comparison with Genetic Programming,” LATEBREAKING PAPERS of the Genetic and Evolutionary Computation Conference, pp. 219-226, 2001.
12. S. Mabu, K. Hirasawa, J. Hu, and J. Murata, “Online Learning of Genetic Network Programming,” Trans. IEE Japan, Vol.122-C, No.3, pp. 355-362, 2002.
13. H. Katagiri, K. Hirasawa, J. Hu, J. Murata, and M. Kosaka, “Network Structure Oriented Evolutionary Model: Genetic Network Programming -Its Comparison with Genetic Programming-,” Trans. of the Society of Instrument and Control Engineers, Vol.38, No.5, pp. 485-494, 2002.
14. R. S. Sutton, and A. G. Barto, “Reinforcement Learning,” MIT Press, 1998.
15. Y. Matsuya, K. Hirasawa, J. Hu, and J. Murata, “Automatic Generation of Programs using Genetic Network Programming,” Proc. of the SICE Annual Conference 2002 in Osaka, pp. 942-947, 2002.
16. Y. Matsuya, K. Hirasawa, J. Hu, and J. Murata, “Automatic Generation of Boolean Functions using Genetic Network Programming,” Proc. of the 4th Asia-Pacific Conference on Simulated Evolution and Learning, pp. 131-135, 2002.