John R. Koza. Genetic programming. The MIT Press, Cambridge, 1992. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Social Simulation Using a Multi-Agent Model Based on.. - Hercog, Fogarty (2001) (Correct)
....agent in the system. There have also been some MAS approaches but, unfortunately, little can be taken from them, since they over simplify the problem by allowing the agents to choose a particular night out of seven to go to the bar [30] 42] The most interesting approach used genetic programming [25] to solve the problem by letting 16 agents communicate with each other [14] 2.1 Why is this problem dicult to learn The El Farol Bar problem can be considered a coordinated collaboration task which the agents have insucient resources and skills to achieve. Coordinated collaboration is the ....
..... The rule representation depends on the problem being solved: ternary (most common) f0,1,#g (the # is known as the don t care symbol) integers, integer intervals [37] real intervals, fuzzy rules [5] 1] 6] and even S expressions [2] LISP expressions which may resemble genetic programming[25]) XCS incorporates accuracy based tness, considered to be a breakthrough in the LCS eld. XCS learns to maximise the reward obtained from the environment, this reward is what drives the search and the self improvement of the system. One of the innovations in XCS is that each classi er has ....
J.R. Koza. Genetic Programming. MA: The MIT Press/Bradford Books, 1992.
Automatic Generation of Control Programs for.. - Busch, Ziegler.. (2002) (Correct)
....robots are walking robots. This term includes all robots that locomote without wheels, caterpillars or similar devices on rm ground. The evolution of robot control programs has been the topic of recent publications. A general introduction into the concept of Genetic Programming can be found in [1, 4, 14]. Several applications of Genetic Programming (or, more generally, Evolutionary Algorithms) to the task of controlling autonomous robots are given in, e.g. 12, 17, 18] The evolution of crawling or walking robots can be found e.g. in [15, 20, 9] For biological inspiration, gait patterns of ....
J. R. Koza. Genetic Programming. MIT Press, Cambridge, MA, 1992.
Explicit Control of Diversity - And Ective Variation (Correct)
....on program semantics. We will see that even strong restrictions of the maximum allowed mutation distance do not necessarily restrict freedom of variation. 2 Basics on Linear GP Programs in tree based genetic programming (TGP) denote expressions from a functional programming language like LISP [10]. In linear genetic programming (LGP) 1] instead, the program representation consists of variable length sequences of instructions from an imperative programming language like machine code [11] or C [3] Operations manipulate variables (registers) and constants and assign the result to a ....
....parts of programs rather emerge to be quite robust against bigger e ective mutations steps. 8 Future Work and Conclusion A two level tournament selection may also be used for implementing a complexity control. Compared to a weighted complexity term in the tness function (parsimony pressure) [10], tness selection is less in uenced by a complexity selection on the second level and nding an appropriate weighting of objectives is not required. Moreover, the separation of linear genetic programs in e ective and non e ective code o ers the possibility for a selective complexity selection. ....
J.R. Koza, Genetic Programming. MIT Press, Cambridge, MA, 1992.
Inductive Functional Programming Using Incremental - Program Transformation Roland (Correct)
....input output pairs [2, 8, 10] or positive and negative examples as in inductive logic programming [6, 7, 9, 12] In such systems, the input output pairs or the examples must have a structure that corresponds to a specific algorithm. At the other end of the spectrum are genetic algorithm systems [5] and ADATE, which use specifications such that the ratio between the difficulty of writing a desirable program and the difficulty of specification may be enormous. An important difference between ADATE and GA systems is that the latter are very poor at inferring recursive programs since they use ....
....problem number i. 1. Consider the specification of a function split : a list a list a list that splits a list Xs into a pair of lists (Ys,Zs) such that the lengths of Ys and Zs differ by at most one. The split function is useful when implementing merge sort. The input output pair ( [1,2,3,4,5,6,7,8], 1,2,3,4] 5,6,7,8] obviously reflects the particular algorithm that chooses Ys to the first half of Xs and Zs to the second half. However, the following split algorithm is both simpler and faster. fun split nil = nil,nil) split (X1: Xs1) case split Xs1 of (Ys,Zs) X1: Zs,Ys) ....
[Article contains additional citation context not shown here]
J.R. Koza, Genetic Programming (MIT Press, Cambridge, Massachusetts, 1992).
Evolutionary Computation: Comments on the History and.. - Bäck, Hammel, Schwefel (1997) (Correct)
.... international conferences on the techniques were offered ( 56] 57] 58] 59] 60] 61] mainly focusing on genetic algorithms, 62] 63] 64] 65] 66] with an early emphasis on evolutionary programming, 67] 68] 69] as small workshops on theoretical aspects of genetic algorithms, [70] as a genetic programming conference, 71] 72] 73] 74] with the general theme of problem solving methods gleaned from nature, and [75] 76] 77] 78] with the general topic of evolutionary computation) But somewhat surprisingly, the researchers in the various disciplines of evolutionary ....
.... Algorithm Variants Although it is impossible to present a thorough overview of all variants of evolutionary computation here, it seems appropriate to explicitly mention order based genetic algorithms [18] 82] classifier systems [161] 162] and genetic programming [163] 81] 31] [70] as branches of genetic algorithms that have developed into their own directions of research and application. The following overview is restricted to a brief statement of their domain of application and some literature references: ffl Order based genetic algorithms were proposed for searching the ....
[Article contains additional citation context not shown here]
J. R. Koza, D. E. Goldberg, D. B. Fogel, and R. L. Riolo, Eds., Genetic Programming 1996.
Automated Programming Framework Using - Constraint-Based Static Analysis (Correct)
....That is, when given positive and negative examples, the ILP system computes the rules of classifying examples as a logic program both by generalizing the positive examples and by specializing the rules not to include the negative examples. Our framework might be formalized as genetic programming [13]. Fitness values would be computed based on mode type correctness and the plausibility criteria for our framework. When given parts of a program (i.e. 68 CHAPTER 6. geneses) the GP system evolves them into an optimum program under a certain fitness evaluation by using genetic manipulations such ....
J. Koza. Genetic Programming. The MIT Press, Cambridge, MA, 1992.
A Three-Dimensional Environment for Self-Reproducing Programs - Ebner (Correct)
....new individuals and avoid overwriting their own o spring. After a short time all CPUs are lled by self reproducing individuals and competition between individuals sets in which results in an increased rate of speciation. 1 Introduction Evolution of computer programs, Genetic Programming [17,18,2], is usually a very dicult task because small changes to the program s code are often lethal. Changing a single byte in any large application program is very likely to cause such a severe error that the mutated program no longer performs its intended function. This violates the principle of strong ....
J. R. Koza. Genetic Programming. The MIT Press, Cambridge, MA, 1992.
Evolutionary Learning of Graph Layout Constraints from Examples - Masui (1994) (5 citations) (Correct)
....ex Bad Layout Better (1) distance between nodes (2) arc direction (3) line crossing (4) symmetry (5) angle between arcs (6) uniformity Figure 1: Constraints used in the layout of directed graphs. amples, and the system infers the evaluation function using genetic programming technique[12], where a population of tree structured evaluation functions evolve to a function which reflects the user s preferences, under many generations of Darwinian selection pressure. Once such an evaluation function is obtained, it is used as the user s own preference function to be used with ....
....but accept the resulting layout. In any case, if users can show their preference somehow and specify the evaluation function to the system, stochastic methods become much more appealing. DEVELOPING THE LAYOUT EVALUATION FUNCTION THROUGH GENETIC PROGRAMMING Genetic Programming Genetic programming[12] is a technique to make randomlygenerated programs evolve to a program which conforms to the specification given by the user, just like performing optimization in genetic algorithms. Programs are usually represented as trees, like the S expressions of Lisp. The algorithm starts with many ....
Koza, J. R. Genetic Programming. The MIT Press, Cambridge, MA, 1992.
Genetic and Evolutionary Computation: - Who What Where (2006) Self-citation (Poli) (Correct)
No context found.
Koza, J. R. and Poli, R. (2005). Genetic programming.
submitted to Machine Learning, , 1--25 () c - Stimulus Response Learning (Correct)
No context found.
John R. Koza. Genetic programming. The MIT Press, Cambridge, 1992.
Multi-Cellular Reconfigurable Circuits: Evolution Morphogenesis.. - Roggen (2005) (Correct)
No context found.
J. R. Koza, Genetic Programming. Cambridge, MA: MIT Press, 1992.
The Role of Completeness in Convergence of - Evolutionary Algorithms Eugene (Correct)
No context found.
Koza J., Genetic Programming I, The MIT Press, 1992.
BioSystems 82 (2005) 1--19 - Toward Theory Of (Correct)
No context found.
Koza, J., 1992. Genetic Programming I. The MIT Press.
Using Artificial Neural Networks to Construct a Meta-Model for .. - Dahm, Ziegler (2002) (2 citations) (Correct)
No context found.
J. R. Koza, Genetic Programming. Cambridge, MA: MIT Press, 1992.
Paradigmatic Analysis Using Genetic Programming - Grilo, Machado, Cardoso (2001) (Correct)
No context found.
J. R. Koza. Genetic Programming. Cambridge, MA: The MIT Press, 1992.
Evolutionary computation, engineering design.. - Evolutionary.. (2001) (Correct)
No context found.
Koza, Z. (1992), Genetic Programming, MIT Press, Cambridge, MA.
Evolving Bin Packing Heuristics with Genetic - Programming Burke Hyde (2006) (Correct)
No context found.
Koza, J.R., Poli, R.: Genetic programming. In Burke, E.K., Kendall, G., eds.: Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques. Kluwer, Boston (2005) 127--164
Evolving Evolutionary Algorithms Using Linear Genetic Programming - Oltean (2005) (Correct)
No context found.
Koza, J. R. (1992). Genetic Programming, On the Programming of Computers by Means of Natural Selection, MIT Press, Cambridge, MA.
Reliable and Precise Gait Modeling - For Quadruped Robot (2005) (Correct)
No context found.
J. R. Koza. Genetic Programming. MIT Press, Cambridge, MA, 1992.
Compressed Linear Genetic Programming: empirical.. - Even-N-Parity Problem.. (Correct)
No context found.
J. R. Koza, D. E. Goldberg, D. B. Fogel, and R. L. Riolo, editors. Genetic Programming 1996.
The Inference Based On Molecular Computing - Wasiewicz, Janczak, Mulawka, Al. (2000) (Correct)
No context found.
Koza J.R.. 1992. Genetic Programming. MIT Press, Cambridge, MA.
Linear Genetic Programming using a compressed genotype.. - Johan Parent Ir (Correct)
No context found.
J. R. Koza, D. E. Goldberg, D. B. Fogel, and R. L. Riolo, editors. Genetic Programming 1996.
Addressing the Even-n-parity problem using Compressed - Linear Genetic Programming (Correct)
No context found.
J. R. Koza, D. E. Goldberg, D. B. Fogel, and R. L. Riolo, editors. Genetic Programming 1996.
Nature and Scope of AI Techniques - Ajith Abraham Oklahoma (Correct)
No context found.
Koza, J.R. (1992) Genetic Programming, MIT Press, Cambridge, MA.
Evolutionary Computation - Ajith Abraham Oklahoma (2005) (Correct)
No context found.
Koza, J.R. (1992) Genetic Programming, MIT Press, Cambridge, MA.
Evolutionary Computation: from Genetic Algorithms to.. - Abraham, Nedjah.. (Correct)
No context found.
Koza. J.R., Genetic Programming. The MIT Press, Cambridge, Massachusetts, 1992.
On the Application of Hierarchical Coevolutionary - Genetic Algorithms.. (Correct)
No context found.
Koza, J.R. (1991) Genetic Programming. MIT Press.
Research on the Improvement of Efficiency of EDAs for Optimization - Paul (2004) (Correct)
No context found.
J.R. Koza, Genetic programming, MIT Press, Cambridge, MA, 1992.
When Evolving Populations is Better than Coevolving Individuals.. - Miconi (2003) (Correct)
No context found.
J. Koza. Genetic Programming. MIT Press, 1992.
Evolution of trading rules for the FX market - Or How To (Correct)
No context found.
J.R.Koza,Genetic Programming MIT Press, Cambridge MA, 1992.
Learning Classifier Systems from a Reinforcement Learning.. - Lanzi (2000) (2 citations) (Correct)
No context found.
John Koza. Genetic Programming. MIT Press, 1992.
The Evolution of Concurrent Programs - Ross (1998) (Correct)
No context found.
J.R. Koza. Genetic Programming. MIT Press, 1992.
utonomous Controller Design for Unmanned Aerial Vehicles using.. - Barlow (2004) (Correct)
No context found.
Koza, J.: Genetic Programming. MIT Press (1992)
Sub-Symbolic Representation and Search Operators for Genetic.. - Page (1999) (Correct)
No context found.
J. R. Koza, David Andre, F. H. Bennett III, and M. Keane. Genetic Programming 3. MIT Press, Cambridge, MA, USA, 1998. Forthcoming.
Autonomous Controller Design for Unmanned Aerial Vehicles using.. - Barlow (2004) (Correct)
No context found.
J. Koza, Genetic Programming. MIT Press, 1992.
Feature Selection and Classifier Ensembles: A Study on.. - Yu (2003) (Correct)
No context found.
John R. Koza. Genetic programming. In James G. Williams and Allen Kent, editors, Encyclopedia of Computer Science and Technology, volume 39, pages 29--43. Marcel-Dekker, 1998. 57
Genetic Programming for Data Classification: Refining the .. - Eggermont, Kok, Kosters (2003) (Correct)
No context found.
J.R. Koza. Genetic Programming. MIT Press, 1992.
RoboCup 2002 - Hans-Dieter Burkhard Uwe (2002) (Correct)
No context found.
J. R. Koza. Genetic Programming. MIT Press, Cambridge, MA, 1992.
Computer Creativity in the Automatic Design of Robots - Pollack, Hornby, Lipson, Funes (2002) (Correct)
No context found.
J. Koza. Genetic Programming. MIT Press, 1992.
Special Issue on "Agent-Based Modelling of Evolutionary.. - In Ieee Transactions (Correct)
No context found.
J. R. Koza, Genetic Programming, MIT Press, Cambridge, 1992.
Software Quality Analysis With the Use of Computational.. - Marek Reformat Witold (Correct)
No context found.
J.R. Koza, Genetic Programming, MIT Press, Cambridge, 1992.
Fusion of Infrared and Visible Images for Face Recognition - Gyaourova, Bebis, Pavlidis (Correct)
No context found.
Koza, J.: Genetic Programming. MIT Press (1993)
MERBIS - A Self-Adaptive Multi-Objective - Evolutionary Rule Base (2003) (Correct)
No context found.
John R. Koza. Genetic programming. In James G. Williams and Allen Kent, editors, Encyclopedia of Computer Science and Technology, volume 39, pages 29--43. Marcel-Dekker, 1998.
Genetic Programming for Data Classification: Partitioning.. - Eggermont, Kok, al. (2004) (Correct)
No context found.
J. Koza. Genetic Programming. MIT Press, 1992.
Infrared and Visible Image Fusion for Face Recognition - Saurabh Singh Aglika (Correct)
No context found.
Koza, J., Genetic Programming, MIT Press, 1993.
A Domain Independent Approach to 2D Object Detection Based on the.. - Zhang (2000) (2 citations) (Correct)
No context found.
J. R. Koza, K. Deb, M. Dorigo, D. B. Fogel, M. Garzon, H. Iba, and R. Riolo. Genetic Programming 1997.
A Domain Independent Approach to 2D Object Detection Based on the.. - Zhang (2000) (2 citations) (Correct)
No context found.
J. R. Koza, W. Banzhaf, K. Chellapilla, K. Deb, M. Dorigo, D. B. Fogel, M. Garzon, D. E. Goldberg, H. Iba, and R. Riolo. Genetic Programming 1998.
On Expressiveness of Evolutionary Computation: Is EC Algorithmic? - Eberbach (2002) (Correct)
No context found.
Koza J., Genetic Programming I, II, III, The MIT Press, 1992.
Parameter Control in Evolutionary Algorithms - Eiben, Hinterding, Michalewicz (1999) (21 citations) (Correct)
No context found.
J.R. Koza. Genetic Programming. MIT Press, 1992.
Evolution of Robot Leg Movements in a Physical Simulation - Ziegler, Banzhaf (2001) (Correct)
No context found.
J. R. Koza. Genetic Programming. MIT Press, Cambridge, MA, 1992.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC