You are in : Home » Results & submissions » Select UOA » 11 - Computer Science and Informatics » View submission: University of Sheffield » Outputs » Detail

Output details

11 - Computer Science and Informatics

University of Sheffield

Return to search Previous output Next output

Output 9 of 109 in the submission

Article title

A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms

Type

D - Journal article

DOI

10.1109/TEVC.2012.2202241

Title of journal

IEEE Transactions on Evolutionary Computation

Article number

Volume number

Issue number

First page of article

418

ISSN of journal

19410026

Year of publication

2012

URL

Number of additional authors

Additional information

<12>The paper introduces an easy-to-use method for achieving a notoriously difficult task: proving lower runtime bounds for evolutionary algorithms. The lower bounds results apply to all mutation-based evolutionary algorithms (as opposed to a single one), allowing optimal designs of evolutionary algorithms to be designed for the first time. The method has become a standard technique as featured in tutorials at international conference series (ACM-GECCO, IEEE-CEC, ThRaSH) and textbooks (including Springer ISBN-978-3-642-17338-7). With preliminary versions it has 23 GoogleScholar cites. IEEE TEVC has an A* ERA ranking, with an IF of 4.81 and is 1/100 in Computer Science, Theory and Methods.

Interdisciplinary

Cross-referral requested

Research group

G - Verification and Testing

Citation count

Proposed double-weighted

Double-weighted statement

Reserve for a double-weighted output

Non-English

English abstract