-
2
-
-
0003984832
-
Population-based incremental learning: A method for integrating genetic search based function optimization and competive learning
-
Computer Science Department, Carnegie Mellon University
-
Baluja, S.: Population-based incremental learning: A method for integrating genetic search based function optimization and competive learning. Technical Report CMU-CS-94-163, Computer Science Department, Carnegie Mellon University (1994)
-
(1994)
Technical Report
, vol.CMU-CS-94-163
-
-
Baluja, S.1
-
3
-
-
84958959530
-
From recombination of genes to the estimation of distributions i: Binary parameters
-
Mühlenbein, H., Paaß, G.: From recombination of genes to the estimation of distributions i: Binary parameters. In: Proceedings of PPSN IV. (1996) 178-187
-
(1996)
Proceedings of PPSN IV
, pp. 178-187
-
-
Mühlenbein, H.1
Paaß, G.2
-
4
-
-
15544368372
-
The sensitivity of pbil to its learning rate and how detailed balance can remove it
-
long, K.A.D., Poli, R., Rowe, J.E., eds. Morgan Kaufmann
-
Shapiro, J.L.: The sensitivity of pbil to its learning rate and how detailed balance can remove it. In long, K.A.D., Poli, R., Rowe, J.E., eds.: Foundations of Genetic Algorithms 7. Morgan Kaufmann (2003) 115-132
-
(2003)
Foundations of Genetic Algorithms
, vol.7
, pp. 115-132
-
-
Shapiro, J.L.1
-
5
-
-
15544377453
-
The detailed balance principle in estimation of distribution algorhithm
-
Shapiro, J.L.: The detailed balance principle in estimation of distribution algorhithm. Evolutionary Computation 13(1) (2005) 99-124
-
(2005)
Evolutionary Computation
, vol.13
, Issue.1
, pp. 99-124
-
-
Shapiro, J.L.1
-
6
-
-
32444444502
-
Not all linear functions are equally difficult for the compact genetic algorithm
-
ACM
-
Droste, S.: Not all linear functions are equally difficult for the compact genetic algorithm. In: GECCO'05, ACM (2005) 679-686
-
(2005)
GECCO'05
, pp. 679-686
-
-
Droste, S.1
-
7
-
-
0036856581
-
Mathematical modelling of umcac algorithm with tournament selection: Behaviour on linear and quadratic functions
-
Gonzalez, C., Lozano, J., Larranaga, P.: Mathematical modelling of umcac algorithm with tournament selection: Behaviour on linear and quadratic functions. International Journal of Approximate Reasoning 31(3) (2002) 313-340
-
(2002)
International Journal of Approximate Reasoning
, vol.31
, Issue.3
, pp. 313-340
-
-
Gonzalez, C.1
Lozano, J.2
Larranaga, P.3
-
8
-
-
0011799584
-
Bayesian optimization algorithm, population sizing, and time to converge
-
Pelikan, M., Goldberg, D.E., Cantú-Paz, E.: Bayesian optimization algorithm, population sizing, and time to converge. In: Proceedings of GECCO 2000. (2000) 275-282
-
(2000)
Proceedings of GECCO 2000
, pp. 275-282
-
-
Pelikan, M.1
Goldberg, D.E.2
Cantú-Paz, E.3
-
11
-
-
0011837986
-
Evolutionary computation and beyond
-
Uesaka, Y., Kanerva, P., Asoh, H., eds. CLSI Publications
-
Mühlenbein, H., Mahnig, T.: Evolutionary computation and beyond. In Uesaka, Y., Kanerva, P., Asoh, H., eds.: Foundations of Real-World Intelligence. CLSI Publications (2001) 123-186
-
(2001)
Foundations of Real-world Intelligence
, pp. 123-186
-
-
Mühlenbein, H.1
Mahnig, T.2
|