ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1206.3522
  4. Cited By
General Upper Bounds on the Running Time of Parallel Evolutionary
  Algorithms

General Upper Bounds on the Running Time of Parallel Evolutionary Algorithms

15 June 2012
Jörg Lässig
Dirk Sudholt
ArXivPDFHTML

Papers citing "General Upper Bounds on the Running Time of Parallel Evolutionary Algorithms"

4 / 4 papers shown
Title
Analysis of Speedups in Parallel Evolutionary Algorithms for
  Combinatorial Optimization
Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization
Jörg Lässig
Dirk Sudholt
59
20
0
08 Sep 2011
A New Method for Lower Bounds on the Running Time of Evolutionary
  Algorithms
A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms
Dirk Sudholt
53
154
0
07 Sep 2011
On the Impact of Mutation-Selection Balance on the Runtime of
  Evolutionary Algorithms
On the Impact of Mutation-Selection Balance on the Runtime of Evolutionary Algorithms
Per Kristian Lehre
Xin Yao
69
44
0
14 Dec 2010
On the approximation ability of evolutionary optimization with
  application to minimum set cover
On the approximation ability of evolutionary optimization with application to minimum set cover
Yang Yu
Xin Yao
Zhi Zhou
76
81
0
17 Nov 2010
1