ECCC
Electronic Colloquium on Computational Complexity
Login | Register | Classic Style



REPORTS > AUTHORS > NILS HEBBINGHAUS:
All reports by Author Nils Hebbinghaus:

TR07-027 | 2nd February 2007
Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt

Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models

The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, there are only a few theoretical results on this subject.
We consider the approximation ability of randomized search for the class of ... more >>>


TR06-083 | 16th May 2006
Nils Hebbinghaus, Benjamin Doerr, Frank Neumann

Speeding up Evolutionary Algorithms by Restricted Mutation Operators

We investigate the effect of restricting the mutation operator in
evolutionary algorithms with respect to the runtime behavior.
Considering the Eulerian cycle problem we present runtime bounds on
evolutionary algorithms with a restricted operator that are much
smaller than the best upper bounds for the ... more >>>




ISSN 1433-8092 | Imprint