Timo Kötzing

Algorithmica, February, 2024

2023

Crossover for Cardinality Constrained Optimization.

[BibT_eX]

[DOI]

ACM Trans. Evol. Learn. Optim., June, 2023

Run Time Bounds for Integer-Valued OneMax Functions.

[BibT_eX]

[DOI]

Jonathan Gadea Harder

Xiaoyue Li

CoRR, 2023

Experimental Analyses of Crossover and Diversity on Jump.

[BibT_eX]

[DOI]

Xiaoyue Li

Proceedings of the Companion Proceedings of the Conference on Genetic and Evolutionary Computation, 2023

ELEA - Build your own Evolutionary Algorithm in your Browser.

[BibT_eX]

[DOI]

Proceedings of the Companion Proceedings of the Conference on Genetic and Evolutionary Computation, 2023

Analysis of (1+1) EA on LeadingOnes with Constraints.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2023

2022

Theoretical Study of Optimizing Rugged Landscapes with the cGA.

[BibT_eX]

[DOI]

Frank Neumann

Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022

Escaping Local Optima with Local Search: A Theory-Driven Discussion.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022

Analysis of a gray-box operator for vertex cover.

[BibT_eX]

[DOI]

Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022

Maps of Restrictions for Behaviourally Correct Learning.

[BibT_eX]

[DOI]

Proceedings of the Revolutions and Revelations in Computability, 2022

2021

Multiplicative Up-Drift.

[BibT_eX]

[DOI]

Algorithmica, 2021

Learning Languages in the Limit from Positive Information with Finitely Many Memory Changes.

[BibT_eX]

[DOI]

Proceedings of the Connecting with Computability, 2021

Towards a Map for Incremental Learning in the Limit from Positive and Negative Information.

[BibT_eX]

[DOI]

Ardalan Khazraei

Proceedings of the Connecting with Computability, 2021

Normal Forms for Semantically Witness-Based Learners in Inductive Inference.

[BibT_eX]

[DOI]

Proceedings of the Connecting with Computability, 2021

Mapping Monotonic Restrictions in Inductive Inference.

[BibT_eX]

[DOI]

Proceedings of the Connecting with Computability, 2021

Learning Languages with Decidable Hypotheses.

[BibT_eX]

[DOI]

Julian Berger

Maximilian Böther

Jonathan Gadea Harder

Proceedings of the Connecting with Computability, 2021

2020

Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming.

[BibT_eX]

[DOI]

Johannes Lengler

Anna Melnichenko

Theor. Comput. Sci., 2020

Analysis of the (1 + 1) EA on subclasses of linear functions under uniform and linear constraints.

[BibT_eX]

[DOI]

Frank Neumann

Martin Schirneck

Theor. Comput. Sci., 2020

The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time.

[BibT_eX]

[DOI]

Johannes Lengler

Theor. Comput. Sci., 2020

Maps for Learning Indexable Classes.

[BibT_eX]

[DOI]

Julian Berger

Maximilian Böther

Jonathan Gadea Harder

CoRR, 2020

Learning Half-Spaces and other Concept Classes in the Limit with Iterative Learners.

[BibT_eX]

[DOI]

Ardalan Khazraei

CoRR, 2020

Correction to: Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints.

[BibT_eX]

[DOI]

Algorithmica, 2020

Improved Fixed-Budget Results via Drift Analysis.

[BibT_eX]

[DOI]

Carsten Witt

Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020

Cautious Limit Learning.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 2020

2019

First-hitting times under drift.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Unbiasedness of estimation-of-distribution algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints.

[BibT_eX]

[DOI]

Algorithmica, 2019

Island Models Meet Rumor Spreading.

[BibT_eX]

[DOI]

Algorithmica, 2019

Solving Problems with Unknown Solution Length at Almost No Extra Cost.

[BibT_eX]

[DOI]

Algorithmica, 2019

Limit Learning Equivalence Structures.

[BibT_eX]

[DOI]

Ekaterina B. Fokina

Luca San Mauro

Proceedings of the Algorithmic Learning Theory, 2019

Mixed Integer Programming versus Evolutionary Computation for Optimizing a Hard Real-World Staff Assignment Problem.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

2018

Escaping Local Optima Using Crossover With Emergent Diversity.

[BibT_eX]

[DOI]

IEEE Trans. Evol. Comput., 2018

Intuitive Analyses via Drift Theory.

[BibT_eX]

[DOI]

Andreas Göbel

CoRR, 2018

Learning Families of Formal Languages from Positive and Negative Information.

[BibT_eX]

[DOI]

Martin Aschenbach

CoRR, 2018

Preface to the Special Issue on Theory of Genetic and Evolutionary Computation.

[BibT_eX]

[DOI]

Dirk Sudholt

Algorithmica, 2018

Static and Self-Adjusting Mutation Strengths for Multi-valued Decision Variables.

[BibT_eX]

[DOI]

Algorithmica, 2018

First-Hitting Times Under Additive Drift.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

First-Hitting Times for Finite State Spaces.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

Ring Migration Topology Helps Bypassing Local Optima.

[BibT_eX]

[DOI]

Clemens Frahnow

Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

Improving the run time of the (1 + 1) evolutionary algorithm with luby sequences.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2018

2017

The Compact Genetic Algorithm is Efficient Under Extreme Gaussian Noise.

[BibT_eX]

[DOI]

IEEE Trans. Evol. Comput., 2017

A Solution to Wiehagen's Thesis.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2017

Reoptimization times of evolutionary algorithms on linear functions under dynamic uniform constraints.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Bounding bloat in genetic programming.

[BibT_eX]

[DOI]

Johannes Lengler

Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Unknown solution length problems with no asymptotically optimal run time.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Analyzing search heuristics with differential equations.

[BibT_eX]

[DOI]

Anna Melnichenko

Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Resampling vs Recombination: a Statistical Run Time Estimation.

[BibT_eX]

[DOI]

Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2017

Analysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear Constraints.

[BibT_eX]

[DOI]

Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2017

Scaling up Local Search for Minimum Vertex Cover in Large Graphs by Parallel Kernelization.

[BibT_eX]

[DOI]

Proceedings of the AI 2017: Advances in Artificial Intelligence, 2017

Normal Forms in Semantic Language Identification.

[BibT_eX]

[DOI]

Martin Schirneck

Proceedings of the International Conference on Algorithmic Learning Theory, 2017

A Generic Bet-and-Run Strategy for Speeding Up Stochastic Local Search.

[BibT_eX]

[DOI]

Markus Wagner

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

A map of update constraints in inductive inference.

[BibT_eX]

[DOI]

Raphaela Palenta

Theor. Comput. Sci., 2016

Topological separations in inductive inference.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Enlarging learnable classes.

[BibT_eX]

[DOI]

Sanjay Jain

Frank Stephan

Inf. Comput., 2016

On the role of update constraints and text-types in iterative learning.

[BibT_eX]

[DOI]

Inf. Comput., 2016

Strongly non-U-shaped language learning results by general techniques.

[BibT_eX]

[DOI]

Inf. Comput., 2016

Robustness of Ant Colony Optimization to Noise.

[BibT_eX]

[DOI]

Evol. Comput., 2016

A Generic Bet-and-run Strategy for Speeding Up Traveling Salesperson and Minimum Vertex Cover.

[BibT_eX]

[DOI]

Markus Wagner

CoRR, 2016

Escaping Local Optima using Crossover with Emergent or Reinforced Diversity.

[BibT_eX]

[DOI]

CoRR, 2016

Concentration of First Hitting Times Under Additive Drift.

[BibT_eX]

[DOI]

Algorithmica, 2016

Robustness of Populations in Stochastic Environments.

[BibT_eX]

[DOI]

Christian Gießen

Algorithmica, 2016

Towards an Atlas of Computational Learning Theory.

[BibT_eX]

[DOI]

Martin Schirneck

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

On the Robustness of Evolving Populations.

[BibT_eX]

[DOI]

Andrew M. Sutton

Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

Graceful Scaling on Uniform Versus Steep-Tailed Noise.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

Provably Optimal Self-adjusting Step Sizes for Multi-valued Decision Variables.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

Emergence of Diversity and Its Benefits for Crossover in Genetic Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

Ant Colony Optimization Beats Resampling on Noisy Functions.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2016

Fast Building Block Assembly by Majority Vote Crossover.

[BibT_eX]

[DOI]

Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

EDAs cannot be Balanced and Stable.

[BibT_eX]

[DOI]

Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

The Right Mutation Strength for Multi-Valued Decision Variables.

[BibT_eX]

[DOI]

Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

Escaping Local Optima with Diversity Mechanisms and Crossover.

[BibT_eX]

[DOI]

Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

2015

Fast Learning of Restricted Regular Expressions and DTDs.

[BibT_eX]

[DOI]

Dominik D. Freydenberger

Theory Comput. Syst., 2015

Unbiased Black-Box Complexities of Jump Functions.

[BibT_eX]

[DOI]

Evol. Comput., 2015

The Benefit of Sex in Noisy Evolutionary Search.

[BibT_eX]

[DOI]

CoRR, 2015

The Benefit of Recombination in Noisy Evolutionary Search.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

(1+1) EA on Generalized Dynamic OneMax.

[BibT_eX]

[DOI]

Andrei Lissovoi

Carsten Witt

Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII, Aberystwyth, United Kingdom, January 17, 2015

2014

The Max problem revisited: The importance of mutation in genetic programming.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Iterative learning from positive data and counters.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

The unbiased black-box complexity of partition is polynomial.

[BibT_eX]

[DOI]

Artif. Intell., 2014

Unbiased black-box complexities of jump functions: how to cross large plateaus.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2014

2013

Black-box complexities of combinatorial problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

More effective crossover operators for the all-pairs shortest path problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Memory-limited non-U-shaped learning with solved open problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

MenuOptimizer: interactive optimization of menu systems.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual ACM Symposium on User Interface Software and Technology, 2013

A Normal Form for Argumentation Frameworks.

[BibT_eX]

[DOI]

Cosmina Croitoru

Proceedings of the Theory and Applications of Formal Argumentation, 2013

An effective heuristic for the smallest grammar problem.

[BibT_eX]

[DOI]

Florian Benz

Proceedings of the Genetic and Evolutionary Computation Conference, 2013

Optimizing expected path lengths with ant colony optimization using fitness proportional update.

[BibT_eX]

[DOI]

Matthias Feldmann

Proceedings of the Foundations of Genetic Algorithms XII, 2013

2012

Learning in the limit with lattice-structured hypothesis spaces.

[BibT_eX]

[DOI]

Jeffrey Heinz

Anna Kasprzik

Theor. Comput. Sci., 2012

Theoretical analysis of two ACO approaches for the traveling salesman problem.

[BibT_eX]

[DOI]

Swarm Intell., 2012

Learning secrets interactively. Dynamic modeling in inductive inference.

[BibT_eX]

[DOI]

Inf. Comput., 2012

Deliberative Acceptability of Arguments.

[BibT_eX]

[DOI]

Cosmina Croitoru

Proceedings of the STAIRS 2012, 2012

ACO Beats EA on a Dynamic Pseudo-Boolean Function.

[BibT_eX]

[DOI]

Hendrik Molter

Proceedings of the Parallel Problem Solving from Nature - PPSN XII, 2012

Ants easily solve stochastic shortest path problems.

[BibT_eX]

[DOI]

Ashish Ranjan Hota

Proceedings of the Genetic and Evolutionary Computation Conference, 2012

Efficient algorithms for extracting biological key pathways with global constraints.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2012

2011

Measuring Learning Complexity with Criteria Epitomizers.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

How crossover helps in pseudo-boolean optimization.

[BibT_eX]

[DOI]

Dirk Sudholt

Madeleine Theile

Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

PAC learning and genetic programming.

[BibT_eX]

[DOI]

Frank Neumann

Reto Spöhel

Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

Too fast unbiased black-box algorithms.

[BibT_eX]

[DOI]

Carola Winzen

Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

Simple max-min ant systems and the optimization of linear pseudo-boolean functions.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Genetic Algorithms, 11th International Workshop, 2011

Faster black-box algorithms through higher arity operators.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Genetic Algorithms, 11th International Workshop, 2011

2010

String Extension Learning Using Lattices.

[BibT_eX]

[DOI]

Anna Kasprzik

Proceedings of the Language and Automata Theory and Applications, 2010

Ant colony optimization and the minimum cut problem.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2010

Strongly Non-U-Shaped Learning Results by General Techniques.

[BibT_eX]

[DOI]

Proceedings of the COLT 2010, 2010

Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem.

[BibT_eX]

[DOI]

Proceedings of the Swarm Intelligence - 7th International Conference, 2010

Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 21st International Conference, 2010

2009

Difficulties in Forcing Fairness of Polynomial Time Inductive Inference.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 20th International Conference, 2009

2008

Dynamic Modeling in Inductive Inference.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 19th International Conference, 2008

Dynamically Delayed Postdictive Completeness and Consistency in Learning.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 19th International Conference, 2008

2007

Feasible Iteration of Feasible Learning Functionals.

[BibT_eX]

[DOI]