We hypothesize that evolutionary algorithms can effectively schedule coordinated fleets of Earth observing satellites. The constraints are complex and the bottlenecks are not well understood, a condition where evolutionary algorithms are often effective. This is, in part, because evolutionary algorithms require only that one can represent solutions, modify solutions, and evaluate solution fitne...

Royal Road functions manipulate the t-ness landscape to provide controlled experiments into genetic algorithm (GA) theory Mitchell et al., 1992]. Variations of clique detection in a graph, e.g., nding both the max clique Soule et al., 1996] and the clique cover Haynes, 1996], have been proposed as naturally occurring Royal Road functions. Soule and Foster have tried to positively correlate diie...

We hypothesize that evolutionary algorithms can effectively schedule coordinated fleets of Earth observing satellites. The constraints are complex and the bottlenecks are not well understood, a condition where evolutionary algorithms are often effective. This is, in part, because evolutionary algorithms require only that one can represent solutions, modify solutions, and evaluate solution fitne...

| Delta coding is an iterative genetic search strategy that sustains search by periodically re-initializing the population. This helps to avoid premature convergence during genetic search. Delta coding also remaps hyper-space with each iteration in an attempt to locate \easier" search spaces with respect to genetic search. Here, the optimization ability of delta coding is compared against the C...

We present N-gram GP, an estimation of distribution algorithm for the evolution of linear computer programs. The algorithm learns and samples the joint probability distribution of triplets of instructions (or 3-grams) at the same time as it is learning and sampling a program length distribution. We have tested N-gram GP on symbolic regressions problems where the target function is a polynomial ...

In this work, a new algorithm for autonomous avatar motion is presented. The new algorithm is based in the Rapidly-exploring Random Tree (RRT) and an appropriate ontology. It uses a novel approach for calculating the motion sequence planning for the different avatar limbs: legs or arms. First, the algorithm uses the information stored in the ontology concerning the avatar structure and the Degr...