Carsten Witt

  1. 2019
  2. Published

    Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint. / Neumann, Frank; Pourhassan, Mojgan; Witt, Carsten.

    Proceedings of the 2019 Genetic and Evolutionary Computation Conference. Association for Computing Machinery, 2019. p. 1506-1514 (GECCO 2019 - Proceedings of the 2019 Genetic and Evolutionary Computation Conference).

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedings – Annual report year: 2019Researchpeer-review

  3. Published

    Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs. / Sutton, Andrew M.; Witt, Carsten.

    Proceedings of the 2019 Genetic and Evolutionary Computation Conference. Association for Computing Machinery, 2019. p. 1515-1522 (GECCO 2019 - Proceedings of the 2019 Genetic and Evolutionary Computation Conference).

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedings – Annual report year: 2019Researchpeer-review

  4. Published

    Upper Bounds on the Running Time of the Univariate Marginal Distribution Algorithm on OneMax. / Witt, Carsten.

    In: Algorithmica, Vol. 81, No. 2, 15.02.2019, p. 632-667.

    Research output: Contribution to journalJournal article – Annual report year: 2019Researchpeer-review

  5. Accepted/In press

    Lower bounds on the run time of the Univariate Marginal Distribution Algorithm on OneMax. / Krejca, Martin S.; Witt, Carsten.

    In: Theoretical Computer Science, 2019.

    Research output: Contribution to journalJournal article – Annual report year: 2019Researchpeer-review

  6. 2018
  7. Published

    On the Choice of the Update Strength in Estimation-of-Distribution Algorithms and Ant Colony Optimization. / Sudholt, Dirk; Witt, Carsten.

    In: Algorithmica, Vol. 81, No. 4, 01.01.2018, p. 1450–1489.

    Research output: Contribution to journalJournal article – Annual report year: 2019Researchpeer-review

  8. Published

    The (1 + λ) Evolutionary Algorithm with Self-Adjusting Mutation Rate. / Doerr, Benjamin; Gießen, Christian; Witt, Carsten; Yang, Jing.

    In: Algorithmica, Vol. 81, No. 2, 01.01.2018, p. 593–631.

    Research output: Contribution to journalJournal article – Annual report year: 2018Researchpeer-review

  9. Published

    Domino convergence: Why one should hill-climb on linear functions. / Witt, Carsten.

    Proceedings of the 2018 Genetic and Evolutionary Computation Conference. Association for Computing Machinery, 2018. p. 1539-1546.

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedings – Annual report year: 2018Researchpeer-review

  10. Published

    Medium step sizes are harmful for the compact genetic algorithm. / Lengler, Johannes; Sudholt, Dirk; Witt, Carsten.

    2018 Proceedings of the Genetic and Evolutionary Computation Conference. Association for Computing Machinery, 2018. p. 1499-1506.

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedings – Annual report year: 2018Researchpeer-review

  11. Published

    Optimal Mutation Rates for the (1+ λ) EA on OneMax Through Asymptotically Tight Drift Analysis. / Gießen, Christian; Witt, Carsten.

    In: Algorithmica, Vol. 80, No. 5, 2018, p. 1710-1731.

    Research output: Contribution to journalJournal article – Annual report year: 2018Researchpeer-review

  12. Published

    Runtime analysis for self-adaptive mutation rates. / Doerr, Benjamin; Witt, Carsten; Yang, Jing.

    2018 Proceedings of the Genetic and Evolutionary Computation Conference. Association for Computing Machinery, 2018. p. 1475-1482.

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedings – Annual report year: 2018Researchpeer-review

Previous 1 2 3 4 5 6 7 Next