Abstract
This Paper describes a method for evolutionary program induction of binary Java bytecode. Like many other machine code based methods it uses a linear genome. The genetic Operators are adapted to the Stack architecture and preserve Stack depth during crossover. In this work we have extended a previous System to nm in a distributed manner on several different physical machines. We call our new System Distributed Java Bytecode Genetic Programming (DJBGP). We use the Voyager package for migration of Java individuals. The system’s feasibility is demonstrated on a telecom routing Problem.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Banzhaf, W., Nordin, P., Keller, R.E., Francone, F.D.: Genetic Programming — An Introduction. On the automatic evolution of computer programs and its applications. Morgan Kaufmann, Germany (1997)
Cramer, N.L.: A representation for adaptive generation of simple sequential programs. In: Grefenstette, J. (ed.) Proceedings of the 1st International Conference on Genetic Algorithms and Their Applications, pp. 183–187 (1985)
Crepeau, R.L.: Genetic Evolution of Machine Language Software, In: Rosca, J. (ed.) Proceeding of the GP workshop at Machine Learning 95, Tahoe City, CA, University of Rochester Technical Report 95.2, Rochester, NY, p. 6–22 (1995)
Harvey, B., Foster, J.A., Frinke, D.: Byte Code Genetic Programming. In: Late Breaking Papers at the Genetic Programming 1998 Conference. University of Wisconsin, Madison (1998)
Huelsberger, L.: Simulated Evolution of Machine Language Iteration. In: Proceeding of:The First International conf. on Genetic Programming, Stanford, USA (1996)
Klanhold, S., Frank, S., Keller, R.: Exploring the Possibilities and Restrictions of Genetic Programming in Java Bytecode. In: Late Breaking Papers at the Genetic Programming 1998 Conference. University of Wisconsin, Madison (1998)
Langdon, W.B., Poli, R.: Why Ants are Hard. School of Computer Science, The University of Birmingham, UK., Technical report: CSRP-98-4 (1998)
Lindholm, T., Yellin, F.: The Java Virtual Machine Specification. Sun Microsystems, Inc., USA (1996)
Lukschandl, E., Holmlund, M., Modén, E.: First experience with the Java Virtual Machine. In: Poli, R., Langdon, W.B., Schoenauer, M., Fogarty, T., Banzhaf, W. (eds.) Late Breaking Papers at EuroGP 1998: the First European Workshop on Genetic Programming, Paris, April 14-15 (1998)
Lukschandl, E., Holmlund, M., Modén, E., Nordahl, M., Nordin, P.: Induction of Java Bytecode with Genetic Programming. In: Koza, J.R. (ed.) Late Breaking Papers at the Genetic Programming 1998 Conference, University of Wisconsin (1998)
Nordin, J.P.: Evolutionary Program Induction of Binary Machine Code and its Application. Krehl Verlag, Muenster (1997)
Venners, B.: Inside the Java Virtual Machine. McGraw-Hill, New York (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lukschandl, E., Borgvall, H., Nohle, L., Nordahl, M., Nordin, P. (2000). Distributed Java Bytecode Genetic Programming with Telecom Applications. In: Poli, R., Banzhaf, W., Langdon, W.B., Miller, J., Nordin, P., Fogarty, T.C. (eds) Genetic Programming. EuroGP 2000. Lecture Notes in Computer Science, vol 1802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46239-2_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-46239-2_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67339-2
Online ISBN: 978-3-540-46239-2
eBook Packages: Springer Book Archive