A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms (2013)
Attributed to:
SEBASE: Software Engineering By Automated SEarch
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1109/tevc.2012.2202241
Publication URI: http://dx.doi.org/10.1109/tevc.2012.2202241
Type: Journal Article/Review
Parent Publication: IEEE Transactions on Evolutionary Computation
Issue: 3
ISSN: 1089-778X