The complex parameter landscape of the compact genetic algorithm

HIGHLIGHTS

• who: Johannes Lengler from the Department Computer Science, ETH Zürich, Zürich, Switzerland University Sheffield, Sheffield , DP, United Kingdom have published the article: The Complex Parameter Landscape of the Compact Genetic Algorithm, in the Journal: (JOURNAL)
• what: The authors show that population sizes in between two optimal regimes are worse as they yield larger runtimes:√ the authors prove a lower bound 𝛺(K 1∕3 n + n log n) for cGA on OneMax for K = O( n∕ log2 n). The authors show that the runtime of the cGA does indeed increase, where the authors formally . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or Email

  Password

  Remember me

  Lost your password?

  If you don't have an account, you can create one here.