In this thesis I present a language for instructing a sheet of identically-programmed, flexible,
autonomous agents (" cells") to assemble themselves into a predetermined global shape …

We investigate the potential of a microgenetic algorithm (MGA) as a generalized hill-
climbing operator. Combining a standard GA with the suggested MGA operator leads to a …

Randomized search heuristics like simulated annealing and evolutionary algorithms are
applied successfully in many different situations. However, the theory on these algorithms is …

Accelerating a genetic algorithm (GA) by implementing it in a reconfigurable field
programmable gate array (FPGA) is described. The implemented GA features: random …

Epochal dynamics, in which long periods of stasis in an evolving population are punctuated
by a sudden burst of change, is a common behavior in both natural and artificial evolutionary …

First we show that all genetic algorithms can be approximated by an algorithm which keeps
the population in linkage equilibrium. Here the genetic population is given as a product of …

In this paper, UEGO, a new general technique for accelerating and/or parallelizing existing
search methods is suggested. The skeleton of the algorithm is a parallel hill climber. The …

Evolutionary algorithms(EAs) are population-based search heuristics often used for function
optimization. Typically they employ selection, crossover, and mutation as search operators. It …

Our analysis seeks to exemplify the utility of crossover by studying a nonseparable building-
block problem that is as easy as possible under recombination but very hard for any kind of …

We analyze the performance of a genetic algorithm (GA) we call Culling, and a variety of
other algorithms, on a problem we refer to as the Additive Search Problem (ASP). We show …