On the analysis of the (1+1) evolutionary algorithm
- Stefan Droste, T. Jansen, I. Wegener
- Computer ScienceTheoretical Computer Science
- 1 April 2002
The complexity of Boolean functions
- I. Wegener
- Computer Science
- 1987
This chapter discusses Circuits and other Non-Uniform Computation Methods vs. Turing Machines and other Uniform Computation Models, and the Design of Efficient Circuits for Some Fundamental Functions.
Improving the Variable Ordering of OBDDs Is NP-Complete
- Beate Bollig, I. Wegener
- Computer ScienceIEEE Trans. Computers
- 1 September 1996
Ordered binary decision diagrams are a useful representation of Boolean functions, if a good variable ordering is known. Variable orderings are computed by heuristic algorithms and then improved with…
Branching Programs and Binary Decision Diagrams
- I. Wegener
- Computer Science
- 1987
Branching Programs and Binary Deci-sion Diagrams-Theory and Applications
- I. Wegener
- Computer Science
- 1987
Theoretical results show that randomized BDDs and Algorithms, based on other Decomposition Rules, can be used in Verification and Model Checking and Application in Optimization, Counting, and Genetic Programming Bibliography Index.
Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization
- Stefan Droste, T. Jansen, I. Wegener
- Computer ScienceTheory of Computing Systems
- 16 November 2004
Lower bounds on the black-box complexity of problems are derived without complexity theoretical assumptions and are compared with upper bounds in this scenario.
The analysis of evolutionary algorithms on sorting and shortest paths problems
- J. Scharnow, K. Tinnefeld, I. Wegener
- Computer ScienceJ. Math. Model. Algorithms
- 1 December 2004
This work analyzes simple EAs on well-known problems, namely sorting and shortest paths, and finds that sorting is the maximization of “sortedness” which is measured by one of several well- known measures of presortedness.
On the Choice of the Offspring Population Size in Evolutionary Algorithms
- T. Jansen, K. D. Jong, I. Wegener
- Computer ScienceEvolutionary Computation
- 1 December 2005
Using a simplified but still realistic evolutionary algorithm, a thorough analysis of the effects of the offspring population size is presented and a simple way to dynamically adapt this parameter when necessary is suggested.
Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness
- T. Jansen, I. Wegener
- PhysicsIEEE Transactions on Evolutionary Computation
- 1 December 2001
A pair of skis are provided on their upper surfaces with respective mounting plates each carrying a treadle depressible by the boot of the user, the treadle overlying the bight of a yoke biased into…
The Analysis of Evolutionary Algorithms—A Proof That Crossover Really Can Help
- T. Jansen, I. Wegener
- Computer ScienceAlgorithmica
- 1 September 2002
It is proved that an evolutionary algorithm can produce enough diversity such that the use of crossover can speedup the expected optimization time from superpolynomial to a polynomial of small degree.
...
...