E-LIB Suche - Ergebnisse für: Larcher, Maxime

1

Hardest Monotone Functions for Evolutionary Algorithms:

, In: Evolutionary Computation in Combinatorial Optimization; Lecture Notes in Computer Science,

Kaufmann, Marc ; Larcher, Maxime ; Lengler, Johannes. - p. 146-161 , 2024

Link: https://doi.org/10.1007/..

2

OneMax is not the Easiest Function for Fitness Improvements:

Kaufmann, Marc ; Larcher, Maxime ; Lengler, Johannes.
Evolutionary Computation. , 2024

Link: https://doi.org/10.1162/..

3

OneMax Is Not the Easiest Function for Fitness Improvements:

, In: Evolutionary Computation in Combinatorial Optimization; Lecture Notes in Computer Science,

Kaufmann, Marc ; Larcher, Maxime ; Lengler, Johannes. - p. 162-178 , 2023

Link: https://doi.org/10.1007/..

4

Self-adjusting population sizes for the (1,λ)-EA on monoton..:

Kaufmann, Marc ; Larcher, Maxime ; Lengler, Johannes.
Theoretical Computer Science. 979 (2023) - p. 114181 , 2023

Link: https://doi.org/10.1016/..

5

Self-adjusting Population Sizes for the $$(1, \lambda )$$-E..:

, In: Lecture Notes in Computer Science; Parallel Problem Solving from Nature – PPSN XVII,

Kaufmann, Marc ; Larcher, Maxime ; Lengler, Johannes. - p. 569-585 , 2022

Link: https://doi.org/10.1007/..

6

Long cycles, heavy cycles and cycle decompositions in digra..:

Knierim, Charlotte ; Larcher, Maxime ; Martinsson, Anders.
Journal of Combinatorial Theory, Series B. 148 (2021) - p. 125-148 , 2021

Link: https://doi.org/10.1016/..

7

Self-adjusting population sizes for the (1,λ)-EA on monoton..:

Kaufmann, Marc ; Larcher, Maxime ; Lengler, Johannes.
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.tcs.2023.114181. , 2023

Link: https://hdl.handle.net/2..

8

Gated recurrent neural networks discover attention:

Zucchet, Nicolas ; Kobayashi, Seijin ; Akram, Yassir...
http://arxiv.org/abs/2309.01775. , 2023

Link: http://arxiv.org/abs/230..

9

Hardest Monotone Functions for Evolutionary Algorithms:

Kaufmann, Marc ; Larcher, Maxime ; Lengler, Johannes.
http://arxiv.org/abs/2311.07438. , 2023

Link: http://arxiv.org/abs/231..

10

Randomness as an Obstacle and a Tool for Optimisation:

Larcher, Maxime
http://hdl.handle.net/20.500.11850/639294. , 2023

Link: https://hdl.handle.net/2..

11

Solving Static Permutation Mastermind using O(n log n) Quer..:

Larcher, Maxime ; Martinsson, Anders ; Steger, Angelika
info:eu-repo/semantics/altIdentifier/doi/10.37236/10280. , 2022

Link: https://hdl.handle.net/2..

12

Self-adjusting Population Sizes for the $(1, \lambda)$-EA o..:

Kaufmann, Marc ; Larcher, Maxime ; Lengler, Johannes.
http://arxiv.org/abs/2204.00531. , 2022

Link: http://arxiv.org/abs/220..

13

OneMax is not the Easiest Function for Fitness Improvements:

Kaufmann, Marc ; Larcher, Maxime ; Lengler, Johannes.
http://arxiv.org/abs/2204.07017. , 2022

Link: http://arxiv.org/abs/220..

14

Solving Static Permutation Mastermind using $O(n \log n)$ Q..:

Larcher, Maxime ; Martinsson, Anders ; Steger, Angelika
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v29i1p20/pdf. , 2022

Link: https://www.combinatoric..

15

Note on Long Paths in Eulerian Digraphs:

Knierim, Charlotte ; Larcher, Maxime ; Martinsson, Anders
http://arxiv.org/abs/2103.05330. , 2021

Link: http://arxiv.org/abs/210..