General Upper Bounds on the Runtime of Parallel Evolutionary Algorithms

Lässig, J. and Sudholt, D. orcid.org/0000-0001-6020-1646 (2014) General Upper Bounds on the Runtime of Parallel Evolutionary Algorithms. Evolutionary Computation, 22 (3). pp. 405-437. ISSN 1063-6560

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © 2014 Massachusetts Institute of Technology. This is an author produced version of a paper subsequently published in Evolutionary Computation. Uploaded in accordance with the publisher's self-archiving policy.
Dates:
  • Published: 13 August 2014
  • Accepted: 1 October 2013
  • Published (online): 13 August 2014
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: 17 May 2016 15:52
Last Modified: 22 Mar 2018 15:04
Published Version: http://dx.doi.org/10.1162/EVCO_a_00114
Status: Published
Publisher: Massachusetts Institute of Technology Press
Refereed: Yes
Identification Number: https://doi.org/10.1162/EVCO_a_00114

Share / Export

Statistics