scispace - formally typeset
Open AccessBook

Genetic Programming: On the Programming of Computers by Means of Natural Selection

TLDR
This book discusses the evolution of architecture, primitive functions, terminals, sufficiency, and closure, and the role of representation and the lens effect in genetic programming.
Abstract
Background on genetic algorithms, LISP, and genetic programming hierarchical problem-solving introduction to automatically-defined functions - the two-boxes problem problems that straddle the breakeven point for computational effort Boolean parity functions determining the architecture of the program the lawnmower problem the bumblebee problem the increasing benefits of ADFs as problems are scaled up finding an impulse response function artificial ant on the San Mateo trail obstacle-avoiding robot the minesweeper problem automatic discovery of detectors for letter recognition flushes and four-of-a-kinds in a pinochle deck introduction to biochemistry and molecular biology prediction of transmembrane domains in proteins prediction of omega loops in proteins lookahead version of the transmembrane problem evolutionary selection of the architecture of the program evolution of primitives and sufficiency evolutionary selection of terminals evolution of closure simultaneous evolution of architecture, primitive functions, terminals, sufficiency, and closure the role of representation and the lens effect Appendices: list of special symbols list of special functions list of type fonts default parameters computer implementation annotated bibliography of genetic programming electronic mailing list and public repository

read more

Citations
More filters
Book

Reinforcement Learning: An Introduction

TL;DR: This book provides a clear and simple account of the key ideas and algorithms of reinforcement learning, which ranges from the history of the field's intellectual foundations to the most recent developments and applications.
Journal ArticleDOI

Deep learning in neural networks

TL;DR: This historical survey compactly summarizes relevant work, much of it from the previous millennium, review deep supervised learning, unsupervised learning, reinforcement learning & evolutionary computation, and indirect search for short programs encoding deep and large networks.
Book

An Introduction to Genetic Algorithms

TL;DR: An Introduction to Genetic Algorithms focuses in depth on a small set of important and interesting topics -- particularly in machine learning, scientific modeling, and artificial life -- and reviews a broad span of research, including the work of Mitchell and her colleagues.
Proceedings ArticleDOI

A modified particle swarm optimizer

TL;DR: A new parameter, called inertia weight, is introduced into the original particle swarm optimizer, which resembles a school of flying birds since it adjusts its flying according to its own flying experience and its companions' flying experience.
Book ChapterDOI

Introduction to Algorithms

Xin-She Yang
TL;DR: This chapter provides an overview of the fundamentals of algorithms and their links to self-organization, exploration, and exploitation.
References
More filters
Book

Using Hard Problems to Create Pseudorandom Generators

TL;DR: This website will give you benefit when searching for this popular book, the using hard problems to create pseudorandom generators, and you will not run out of this book.
Journal ArticleDOI

Automaton introspection

TL;DR: In this article, a hybrid cellular-kinematic automaton is exhibited which can inspect itself and so obtain a complete description of its own structure; the description can be contained in a proper part of the automaton and made available for its own perusal and use in self-simulation, self-reproduction, and self-repair and regulation.
Proceedings Article

A mobile robot with onboard parallel processor and large workspace arm

TL;DR: The MIT AI Lab's second mobile robot, MOBOT-2, has a number of unique design features, including an onboard arm that is lightweight, but has an extremely large working volume.
Book ChapterDOI

Cooperativity in Networks of Pattern Recognizing Stochastic Learning Automata

TL;DR: A class of learning tasks is described that combines aspects of learning automaton tasks and supervised learning pattern-classification tasks and an algorithm is presented, called the associative reward-penalty, or A R−P, algorithm, for which a form of optimal performance has been proved.