With the goal of reducing computational costs without sacrificing accuracy, we describe two
algorithms to find sets of prototypes for nearest neighbor classification. Here, the term …

We present results from experiments in which a genetic algorithm (GA) was used to evolve
cellular automata (CAs) to perform a particular computational task-one-dimensional density …

Adaptation is a primary property of living systems which may take place at many levels. In
even the simplest living things, adaptation acts on a small time scale through the reaction of …

We demonstrate the interesting, counter-intuitive result that simple paths to the global
optimum can be so long that climbing the path is intractable. This means that a unimodal …

Crossover may achieve the fast combination of performant building blocks; but as a
counterpart, crossover may as well break a newly discovered building block. We propose to …

We study a specific aspect of the genetic algorithm (GA): the effect of non-coding segments
on GA performance. Non-coding segments are segments of bits in an individual that provide …

In this paper we extend previous work on automatic motion synthesis for physically realistic
2D articulated figures in three ways. First, we describe an improved motion-synthesis …

Tabu search (TS) is becoming increasingly recognised as an e cient way of nding
highquality solutions to hard combinatorial problems. It may be described as an intelligent …

The fifth event in the series of International Conferences on Genetic Algorithms (ICGA),
which have been held in the United States each odd year since 1985, took place in July …