A tight lower bound on the expected runtime of standard steady state genetic algorithms

Oliveto, P.S., Sudholt, D. orcid.org/0000-0001-6020-1646 and Witt, C. (2020) A tight lower bound on the expected runtime of standard steady state genetic algorithms. In: GECCO '20: Proceedings of the 2020 Genetic and Evolutionary Computation Conference. GECCO '20: Genetic and Evolutionary Computation Conference, 08-12 Jul 2020, Online conference. ACM Digital Library , pp. 1323-1331. ISBN 9781450371285

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © 2020 The Authors. This is an author-produced version of a paper subsequently published in GECCO '20: Proceedings of the 2020 Genetic and Evolutionary Computation Conference. Uploaded in accordance with the publisher's self-archiving policy.
Dates:
  • Accepted: 20 March 2020
  • Published (online): 25 June 2020
  • Published: 25 June 2020
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Depositing User: Symplectic Sheffield
Date Deposited: 27 Apr 2020 09:58
Last Modified: 22 Oct 2021 13:05
Status: Published
Publisher: ACM Digital Library
Refereed: Yes
Identification Number: https://doi.org/10.1145/3377930.3390212
Related URLs:

Share / Export

Statistics