Using Optimal Dependency-Trees for Combinatorial Optimization: Learning the Structure of the Search Space (1997)

by Shumeet Baluja , Scott Davies
Citations:119 - 2 self

Documents Related by Co-Citation

11073 Computers and Intractability: A Guide to the Theory of NP-Completeness – M R Garey, D S Johnson - 1979
7552 Genetic Algorithms – D E Goldberg - 1989
134 MIMIC: Finding Optima by Estimating Probability Densities – Jeremy S. De Bonet, Charles L. Isbell, Jr., Paul Viola - 1996
242 From recombination of genes to the estimation of distributions I. binary parameters – H. Mühlenbein, G. Paaß - 1996
307 Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning – Shumeet Baluja - 1994
233 A Parameter-Less Genetic Algorithm – Georges R. Harik, Fernando G. Lobo - 1999
197 Linkage Learning via Probabilistic Modeling in the ECGA – Georges Harik, Georges Harik - 1999
91 The Bivariate Marginal Distribution Algorithm – Martin Pelikan, Heinz Mühlenbein - 1999
924 Learning Bayesian networks: The combination of knowledge and statistical data – David Heckerman, David M. Chickering - 1995