Searching for authors named "Franz Rothlauf" – sorted by Relevance.
-
Population Sizing for the Redundant Trivial Voting Mapping
- Population Sizing for the Redundant Trivial Voting Mapping Franz Rothlauf Working Paper 2
- Cited by 1 (0 self) – Add To MetaCart
-
Binary Representations of Integers and the Performance of Selectorecombinative Genetic Algorithms
- Franz Rothlauf ⋆ Department of Information Systems University of Bayreuth, Germany franz.rothlauf
- Cited by 1 (0 self) – Add To MetaCart
-
The Influence of Binary Representations of Integers on the Performance of Selectorecombinative Genetic Algorithms
- Genetic Algorithms Franz Rothlauf IlliGAL Report No. 2002014 June 2002 Illinois Genetic Algorithms
- Cited by 2 (0 self) – Add To MetaCart
-
Air Travel Itinerary Market Share Estimation
- , Franz Rothlauf Working Paper 6/2007 March 2007 University of Mannheim Department of Information Systems
- Add To MetaCart
-
PolyEDA: Combining Estimation of Distribution Algorithms and Linear Inequality Constraints
- Grahl and Franz Rothlauf Working Paper 2/2004 January 2004 Working Papers in Information Systems
- Add To MetaCart
-
The Link and Node Biased Encoding Revisited: Bias and Adjustment of Parameters
- and Franz Rothlauf IlliGAL Report No. 2001011 February 2001 Illinois Genetic Algorithms Laboratory
- Cited by 5 (0 self) – Add To MetaCart
-
On the Importance of the Second Largest Eigenvalue on the Convergence Rate of Genetic Algorithms
- Florian Schmitt and Franz Rothlauf IlliGAL Report No. 2001021 June 2001 Illinois Genetic Algorithms
- Cited by 2 (0 self) – Add To MetaCart
-
Developing Efficient Metaheuristics for Communication Network Problems by Using Problem-specific Knowledge
- -specific Knowledge Franz Rothlauf and Armin Heinzl Working Paper 9/2004 August 2004 Working Papers in Information
- Add To MetaCart
-
Redundant Representations in Evolutionary Computation
- Redundant Representations in Evolutionary Computation Franz Rothlauf Working Paper 3/2003 January
- Cited by 16 (2 self) – Add To MetaCart
-
Evolution Strategies, Network Random Keys, and the One-Max Tree Problem
- , Franz Rothlauf 1 , and Hans-Josef Pesch 2 1 Department of Information Systems, University of Bayreuth
- Cited by 4 (0 self) – Add To MetaCart

