1. Ackley, D. H. (1987). A connectionist machine for genetic hillclimbing. Kluwer, Boston.
2. Bäck, T. (1996). Evolutionary Algorithms in Theory and Practice. Oxford University Press.
3. Baluja, S. and Davies, S. (1997). Using optimal dependency-trees for combinatorial optimization: Learning the structure of the search space. Technical report, Carnegie Mellon Report, CMU-CS-97–107.
4. Larrañaga, P., Etxeberria, R., Lozano, J., and Peña, J. (2000). Optimization in continuous domains by learning and simulation of Gaussian networks. In Proceedings of the Workshop in Optimization by Building and using Probabilistic Models. A Workshop within the 2000 Genetic and Evolutionary Computation Conference, GECCO 2000, pages 201–204, Las Vegas, Nevada, USA.
5. Larrañaga, P., Lozano, J. A., and Bengoetxea, E. (2001). Estimation of Distribution Algorithms based on multivariate normal and Gaussian networks. Technical Report KZZA-IK-1–01, Department of Computer Science and Artificial Intelligence, University of the Basque Country.