Stack-Based Genetic Programming

نویسنده

  • Timothy Perkis
چکیده

Some recent work in the field of Genetic Programming (GP) has been concerned with finding optimum representations for evolvable and efficient computer programs. In this paper, I describe a new GP system in which target programs run on a stack-based virtual machine. The system is shown to have certain advantages in terms of efficiency and simplicity of implementation, and for certain classes of problems, its effectiveness is shown to be comparable or superior to current methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

XCS with Stack-Based Genetic Programming

We present an extension of the learning classifier system XCS in which classifier conditions are represented by RPN expressions and stack-based Genetic Programming is used to recombine and mutate classifiers. In contrast with other extensions of XCS involving tree-based Genetic Programming, the representation we apply here produces conditions that are linear programs, interpreted by a virtual s...

متن کامل

Queue-based Genetic Programming

1. STACK-BASED GENETIC PROGRAMMING Genetic Programming, or GP, has traditionally used tree-based techniques for representation and reproduction. The most widely used crossover method is subtree crossover, and the majority of the alternatives in published literature are variants thereof. However, if the trees are manipulated in their prefix or postfix form, other approaches exist that preserve t...

متن کامل

Control structures in linear and stack-based Genetic Programming

Genetic Programming, or GP, has traditionally used prefix trees for representation and reproduction, with implicit flow control. The different clauses (the evaluation condition, the if and else sections, etc.) are all subtrees of the flowcontrol node. Linear and stack-based representations, however, require explicit nodes to define the extent of the control structures. This paper introduces a s...

متن کامل

High-Performance, Parallel, Stack-Based Genetic Programming

HiGP is a new high-performance genetic programming system. This system combines techniques from string-based genetic algorithms, Sexpression-based genetic programming systems, and high-performance parallel computing. The result is a fast, flexible, and easily portable genetic programming engine with a clear and efficient parallel implementation. HiGP manipulates and produces linear programs for...

متن کامل

Faster GPU-based genetic programming using a two-dimensional stack

Genetic Programming (GP) is a computationally intensive technique which also has a high degree of natural parallelism. Parallel computing architectures have become commonplace especially with regards Graphics Processing Units (GPU). Hence, versions of GP have been implemented that utilise these highly parallel computing platforms enabling significant gains in the computational speed of GP to be...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994