-
1
-
-
0037089739
-
Parallel evolutionary algorithms can achieve super-linear performance
-
E. Alba. Parallel evolutionary algorithms can achieve super-linear performance. Information Processing Letters, 82(1):7-13, 2002.
-
(2002)
Information Processing Letters
, vol.82
, Issue.1
, pp. 7-13
-
-
Alba, E.1
-
2
-
-
77955879410
-
A survey of parallel genetic algorithms
-
Illinois Genetic Algorithms Laboratory, University of Illinois at Urbana Champaign, Urbana, IL
-
E. Cantú Paz. A survey of parallel genetic algorithms. Technical report, Illinois Genetic Algorithms Laboratory, University of Illinois at Urbana Champaign, Urbana, IL, 1997.
-
(1997)
Technical Report
-
-
Cantú Paz, E.1
-
3
-
-
0033257772
-
On the scalability of parallel genetic algorithms
-
E. Cantú-Paz andD. E. Goldberg. On the scalability of parallel genetic algorithms. Evolutionary Computation, 7(4):429-449, 1999.
-
(1999)
Evolutionary Computation
, vol.7
, Issue.4
, pp. 429-449
-
-
Cantú-Paz, E.1
Goldberg, D.E.2
-
4
-
-
0004116989
-
-
The MIT Press, 2nd edition
-
T. H. Cormen, C. E. Leiserson, R. L. Rivest, andC. Stein. Introduction to Algorithms. The MIT Press, 2nd edition, 2001.
-
(2001)
Introduction to Algorithms
-
-
Cormen, T.H.1
Leiserson, C.E.2
Rivest, R.L.3
Stein, C.4
-
5
-
-
77955913917
-
A rigorous view on neutrality
-
IEEE press
-
B. Doerr, M. Gnewuch, N. Hebbinghaus, andF. Neumann. A rigorous view on neutrality. In CEC 2007, pages 2591-2597. IEEE press, 2007.
-
(2007)
CEC 2007
, pp. 2591-2597
-
-
Doerr, B.1
Gnewuch, M.2
Hebbinghaus, N.3
Neumann, F.4
-
7
-
-
72249120471
-
Analysis of diversity-preserving mechanisms for global exploration
-
T. Friedrich, P. S. Oliveto, D. Sudholt, andC. Witt. Analysis of diversity-preserving mechanisms for global exploration. Evolutionary Computation, 17(4):455-476, 2009.
-
(2009)
Evolutionary Computation
, vol.17
, Issue.4
, pp. 455-476
-
-
Friedrich, T.1
Oliveto, P.S.2
Sudholt, D.3
Witt, C.4
-
8
-
-
34547374334
-
Analysis of scalable parallel evolutionary algorithms
-
July
-
J. He andX. Yao. Analysis of scalable parallel evolutionary algorithms. In CEC 2006, pages 120-127, July 2006.
-
(2006)
CEC 2006
, pp. 120-127
-
-
He, J.1
Yao, X.2
-
9
-
-
22344431964
-
Real royal road functions: Where crossover provably is essential
-
T. Jansen andI. Wegener. Real royal road functions: where crossover provably is essential. Discrete Applied Mathematics, 149(1-3):111-125, 2005.
-
(2005)
Discrete Applied Mathematics
, vol.149
, Issue.1-3
, pp. 111-125
-
-
Jansen, T.1
Wegener, I.2
-
11
-
-
77955887484
-
Takeover time in parallel populations with migration
-
G. Rudolph. Takeover time in parallel populations with migration. In BIOMA 2006, pages 63-72, 2006.
-
(2006)
BIOMA 2006
, pp. 63-72
-
-
Rudolph, G.1
-
12
-
-
32444441240
-
Crossover is provably essential for the Ising model on trees
-
ACM Press
-
D. Sudholt. Crossover is provably essential for the Ising model on trees. In GECCO 2005, pages 1161-1167. ACM Press, 2005.
-
(2005)
GECCO 2005
, pp. 1161-1167
-
-
Sudholt, D.1
-
14
-
-
34548073100
-
A building-block royal road where crossover is provably essential
-
ACM Press
-
R. A. Watson andT. Jansen. A building-block royal road where crossover is provably essential. In GECCO 2007, pages 1452-1459. ACM Press, 2007.
-
(2007)
GECCO 2007
, pp. 1452-1459
-
-
Watson, R.A.1
Jansen, T.2
-
15
-
-
33646077908
-
Runtime analysis of the (μ+1) EA on simple pseudo-Boolean functions
-
C. Witt. Runtime analysis of the (μ+1) EA on simple pseudo-Boolean functions. Evolutionary Computation, 14(1):65-86, 2006.
-
(2006)
Evolutionary Computation
, vol.14
, Issue.1
, pp. 65-86
-
-
Witt, C.1
|