Paper:
Genetic Network Programming with Rules
Fengming Ye, Lu Yu, Shingo Mabu, Kaoru Shimada,
and Kotaro Hirasawa
2-7 Hibikino, Wakamatsu, Kitakyushu, Fukuoka 808-0135, Japan
- [1] J. H. Holland, “Adaptation in Natural and Artificial Systems,” University of Michigan Press, Ann Arbor, 1975.
- [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. B. Fogel, “An introduction to simulated evolutionary optimization,” IEEE Transactions on Neural Networks, Vol.5, No.1, pp. 3-14, 1994.
- [5] S. Mabu, K. Hirasawa and J. Hu, “A Graph-Based Evolutionary Algorithm: Genetic Network Programming (GNP) and Its extension Using Reinforcement Learning,” Evolutionary Computation, Vol.15, No.3, pp. 369-398, 2007.
- [6] K. Hirasawa, M. Okubo, H. Katagiri, J. Hu, and J. Murata. “Comparison between genetic network programming (GNP) and genetic programming (GP),” Proc. of Congress on Evolutionary Computation, pp. 1276-1282, 2001.
- [7] M. E. Pollack and M. Ringuette. “Introducing the tile-world: Experimentally evaluating agent architectures,” T. Dietterich, and W. Swartout (Eds.), Proc. of the conf. of the American Association for Artificial Intelligence, pp. 183-189, AAAI Press, 1990.
This article is published under a Creative Commons Attribution-NoDerivatives 4.0 Internationa License.