MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Ingo Wegener." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

79 documents found, showing 1 through 10. Next 10 →

ATOM

Real royal road functions for constant population size
by Tobias Storch, Tobias Storch, Ingo Wegener, Ingo Wegener — 2003 — In Proc. of GECCO 2003, Genetic and Evolutionary Computation Conference, no. 2724 in LNCS
… Royal Road Functions for Constant Population Size Tobias Storch and Ingo Wegener No. CI-167/04 Technical…
Cited by 6 (0 self) – Add To MetaCart

The Complexity of Boolean Functions
by Ingo Wegener, Johann Wolfgang Goethe-universität, Ii. Teubner, Wegener Ingo, Wegener Ingo, Wegener Ingo — 1987
…The Complexity of Boolean Functions Ingo Wegener Johann Wolfgang Goethe-Universität WARNING…
Cited by 288 (11 self) – Add To MetaCart

Corrigendum Erratum to: Drift analysis and average time complexity of evolutionary algorithms [Artificial Intelligence 127 (2001) 57-85]
by Jun He, Xin Yao — 2001
… proof methods. Acknowledgements The authors are grateful to Professor Ingo Wegener for drawing our…
Cited by 1 (1 self) – Add To MetaCart

Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
by Frank Neumann, Frank Neumann, Ingo Wegener, Ingo Wegener — 2004 — In Proc. of GECCO ’04
… and Ingo Wegener No. CI-165/04 Technical Report ISSN 1433-3325 February 2004 Secretary of the SFB 531…
Cited by 21 (11 self) – Add To MetaCart

Minimum spanning trees made easier via multi-objective optimization
by Frank Neumann, Frank Neumann, Ingo Wegener, Ingo Wegener — 2006 — Natural Computing
…-Objective Optimization Frank Neumann 1 and Ingo Wegener 2,⋆ 1 Inst. für Informatik und Prakt. Mathematik, Christian…
Cited by 7 (4 self) – Add To MetaCart

Complexity Theoretical Results for Randomized Branching Programs
by Martin Sauerhoff — 1998
… uller Gutachter: Prof. Dr. Ingo Wegener, Prof. Dr. Martin Dietzfelbinger Abstract This work…
Cited by 7 (7 self) – Add To MetaCart

Randomized Search Heuristics as an Alternative to Exact Optimization
by Ingo Wegener — 2004 — LOGIC VERSUS APPROXIMATION, ESSAYS DEDICATED TO MICHAEL M. RICHTER ON THE OCCASION OF HIS 65TH BIRTHDAY, VOLUME 3075 OF LECTURE NOTES IN COMPUTER SCIENCE
… Randomized Search Heuristics as an Alternative to Exact Optimization Ingo Wegener No. CI-168/04 Technical…
Cited by 2 (0 self) – Add To MetaCart

Theory of Evolutionary Algorithms
by H.-G. Beyer, K. De Jong, D. Fogel, I. Wegener, H. -g. Beyer (dortmund, K. De Jong (fairfax, D. Fogel (san Diego, I. Wegener (dortmund — 2000
… Recombination to Search Distributions and Graphical Models 11.20 -- 12.00 Ingo Wegener On the Analysis of a…
Add To MetaCart

The Ising Model on the Ring: Mutation versus Recombination
by S. Fischer, I. Wegener, Simon Fischer, Simon Fischer, Ingo Wegener, Ingo Wegener — 2004 — Proc. of the Genetic and Evolutionary Computation Conference (GECCO 2004). LNCS 3102
… The Ising Model on the Ring: Mutation versus Recombination Simon Fischer and Ingo Wegener No. CI-164…
Cited by 10 (2 self) – Add To MetaCart

The Number of Knight's Tours Equals 33,439,123,484,294 - Counting with Binary Decision Diagrams
by Martin Löbbing, Ingo Wegener — 1996 — Electronic Journal of Combinatorics
… Martin Lobbing and Ingo Wegener FB Informatik, LS II, Univ. Dortmund, 44221 Dortmund, Germany e…
Cited by 5 (0 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB