Tobias Storch

Learn More
Evolutionary and genetic algorithms (EAs and GAs) are quite successful randomized function optimizers. This success is mainly based on the interaction of different operators like selection, mutation, and crossover. Since this interaction is still not well understood, one is interested in the analysis of the single operators. Jansen and Wegener (2001a) have(More)
Occasionally there have been long debates on whether to use elitist selection or not. In the present paper the simple (1, lambda) EA and {1 + lambda) EA operating on {0, l}<sup>n</sup> are compared by means of a rigorous runtime analysis. It turns out that only values for lambda that are logarithmic in n are interesting. An illustrative function is(More)
Evolutionary Algorithms (EAs) are population-based randomized optimizers often solving problems quite successfully. Here, the focus is on the possible effects of changing the parent population size. Therefore, new functions are presented where for a simple mutationbased EA even a decrease of the population size by one leads from an efficient optimization to(More)
We investigate (1,λ) ESs using isotropic mutations for optimization in R by means of a theoretical runtime analysis. In particular, a constant offspring-population size λ will be of interest. We start off by considering an adaptation-less (1,2) ES minimizing a linear function. Subsequently, a piecewise linear function with a jump/cliff is considered, where(More)
PURPOSE A study was performed to assess the stimulation threshold for healthy adults using sinusoidally oscillating gradients. METHOD One hundred thirteen healthy adults were examined in the study. ECG and physiological parameters were measured. All measurements were performed of both the head and the abdomen. The subjects were measured in the supine(More)
We present a new representation for individuals in problems that have cyclic permutations as solutions. To demonstrate its usefulness, we analyze a simple randomized local search and a (1+1) evolutionary algorithm for the Eulerian cycle problem utilizing this representation. Both have an expected runtime of Theta(m<sup>2</sup> log(m)), where m denotes the(More)
Evolutionary algorithms (EAs) are population-based randomized search heuristics that often solve problems successfully. Here the focus is on the possible effects of changing the parent population size in a simple, but still realistic, mutation-based EA. It preserves diversity by avoiding duplicates in its population. On the one hand its behavior on(More)
The Applied Remote Sensing Cluster of the German Aerospace Center (DLR) is responsible for the establishment of the payload ground segment for the future German hyperspectral satellite mission EnMAP (Environmental Mapping and Analysis Program), which is planned to be launched in 2012. EnMAP covers the spectrum from 420 nm to 2450 nm with a spectral(More)
Surprisingly, general heuristics often solve hard combinatorial problems quite suffi-<lb>ciently, although they do not outperform specialized algorithms. Here, the behavior<lb>of simple randomized optimizers on the maximum clique problem is investigated.<lb>We focus on semi-random models for sparse graphs, in which an adversary is even<lb>allowed to insert(More)
Imaging spectroscopy, also known as hyperspectral remote sensing, is based on the characterization of Earth surface materials and processes through spectrally-resolved measurements of the light interacting with matter. The potential of imaging spectroscopy for Earth remote sensing has been demonstrated since the 1980s. However, most of the developments and(More)