1 paper
Marc Kaufmann, Maxime Larcher, Johannes Lengler +1
In this paper we revisit the question how hard it can be for the (1+1) Evolutionary Algorithm to optimize monotone pseudo-Boolean functions. By introducing a more pessimistic sto…