This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baluja, S. (1994). Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning. Tech. Rep. No. CMU-CS-94-163, Carnegie Mellon University, Pittsburgh, PA
Buntine, W. L. (1991). Theory refinement of Bayesian networks. Proceedings of the Uncertainty in Artificial Intelligence (UAI-91), pages 52-60
Inza, I., Larrañaga, P., Etxeberria, R., and Sierra, B. (2000). Feature subset selection by Bayesian network-based optimization. Artificial Intelligence, 123(1-2):157-184
Jordan, M. I., editor (1999). Learning in Graphical Models. MIT, Cambridge, MA
Larrañaga, P. and Lozano, J. A., editors (2002). Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer, Boston, MA
Li, J. and Aickelin, U. (2003). A Bayesian optimization algorithm for the nurse scheduling problem. Proceedings of the IEEE Congress on Evolutionary Computation 2003 (CEC-2003), pages 2149-2156
Mühlenbein, H. and Mahnig, T. (1999). FDA - A scalable evolution-ary algorithm for the optimization of additively decomposed functions. Evolutionary Computation, 7(4):353-376
Mühlenbein, H. and Paaß, G. (1996). From recombination of genes to the estimation of distributions I. Binary parameters. Parallel Problem Solving from Nature, pages 178-187
Pearl, J. (1988). Probabilistic reasoning in intelligent systems: Networks of plausible inference. Morgan Kaufmann, San Mateo, CA
Pelikan, M. (2005). Hierarchical Bayesian optimization algorithm: To-ward a new generation of evolutionary algorithms. Springer, Berlin Heidelberg New York
Pelikan, M., Goldberg, D. E., and Lobo, F. (1999). A survey of optimization by building and using probabilistic models. IlliGAL Report No. 99018, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL
Pelikan, M., Sastry, K., and Goldberg, D. E. (2002). Scalability of the Bayesian optimization algorithm. International Journal of Approximate Reasoning, 31(3):221-258
Rothlauf, F., Goldberg, D. E., and Heinzl, A. (2000). Bad codings and the utility of well-designed genetic algorithms. IlliGAL Report No. 200007, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL
Santarelli, S., Goldberg, D. E., and Yu, T.-L. (2004). Optimization of a constrained feed network for an antenna array using simple and compe-tent genetic algorithm techniques. Proceedings of the Workshop Military and Security Application of Evolutionary Computation (MSAEC-2004)
Sastry, K. (2001). Efficient atomic cluster optimization using a hybrid extended compact genetic algorithm with seeded population. IlliGAL Report No. 2001018, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL
Simon, H. A. (1968). The Sciences of the Artificial. The MIT, Cambridge, MA
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Pelikan, M., Sastry, K., Cantú-Paz, E. (2006). Introduction. In: Pelikan, M., Sastry, K., CantúPaz, E. (eds) Scalable Optimization via Probabilistic Modeling. Studies in Computational Intelligence, vol 33. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-34954-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-34954-9_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34953-2
Online ISBN: 978-3-540-34954-9
eBook Packages: EngineeringEngineering (R0)