{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T12:25:14Z","timestamp":1664540714581},"publisher-location":"Berlin, Heidelberg","reference-count":210,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662435045","type":"print"},{"value":"9783662435052","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-43505-2_45","type":"book-chapter","created":{"date-parts":[[2015,5,28]],"date-time":"2015-05-28T20:47:54Z","timestamp":1432846074000},"page":"899-928","source":"Crossref","is-referenced-by-count":32,"title":["Estimation of Distribution Algorithms"],"prefix":"10.1007","author":[{"given":"Martin","family":"Pelikan","sequence":"first","affiliation":[]},{"given":"Mark W.","family":"Hauschild","sequence":"additional","affiliation":[]},{"given":"Fernando G.","family":"Lobo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"45_CR1","unstructured":"S. Baluja: Population-based incremental learning: A\u00a0method for integrating genetic search based function optimization and competitive learning, Tech. Rep. No. CMU-CS-94-163 (Carnegie Mellon, Pittsburgh 1994)"},{"key":"45_CR2","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/978-3-540-72960-0_18","volume-title":"Advances in Metaheuristics for Hard Optimization","author":"J. Grahl","year":"2008","unstructured":"J. Grahl, S. Minner, P. Bosman: Learning structure illuminates black boxes: An introduction into estimation of distribution algorithms. In: Advances in Metaheuristics for Hard Optimization, ed. by Z. Michalewicz, P. Siarry (Springer, Berlin, Heidelberg 2008) pp. 365\u2013396"},{"issue":"3","key":"45_CR3","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.swevo.2011.08.003","volume":"1","author":"M.W. Hauschild","year":"2011","unstructured":"M.W. Hauschild, M. Pelikan: An introduction and survey of estimation of distribution algorithms, Swarm Evol. Comput. 1(3), 111\u2013128 (2011)","journal-title":"Swarm Evol. Comput."},{"key":"45_CR4","volume-title":"Estimation of Distribution Algorithms: A\u00a0New Tool for Evolutionary Computation","year":"2002","unstructured":"P. Larra\u00f1aga, J.A. Lozano (Eds.): Estimation of Distribution Algorithms: A\u00a0New Tool for Evolutionary Computation (Kluwer Academic, Boston 2002)"},{"key":"45_CR5","volume-title":"Towards a\u00a0New Evolutionary Computation: Advances on Estimation of Distribution Algorithms","year":"2006","unstructured":"J.A. Lozano, P. Larra\u00f1aga, I. Inza, E. Bengoetxea (Eds.): Towards a\u00a0New Evolutionary Computation: Advances on Estimation of Distribution Algorithms (Springer, Berlin, Heidelberg 2006)"},{"key":"45_CR6","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-61723-X_982","volume":"1141","author":"H. M\u00fchlenbein","year":"1996","unstructured":"H. M\u00fchlenbein, G. Paa\u00df: From recombination of genes to the estimation of distributions I. Binary parameters, Lect. Notes Comput. Sci. 1141, 178\u2013187 (1996)","journal-title":"Lect. Notes Comput. Sci."},{"issue":"1","key":"45_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1013500812258","volume":"21","author":"M. Pelikan","year":"2002","unstructured":"M. Pelikan, D.E. Goldberg, F. Lobo: A\u00a0survey of optimization by building and using probabilistic models, Comput. Optim. Appl. 21(1), 5\u201320 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"45_CR8","volume-title":"Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications","year":"2006","unstructured":"M. Pelikan, K. Sastry, E. Cant\u00fa-Paz (Eds.): Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications (Springer, Berlin, Heidelberg 2006)"},{"issue":"3","key":"45_CR9","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1109\/TCBB.2010.18","volume":"8","author":"R. Arma\u00f1anzas","year":"2011","unstructured":"R. Arma\u00f1anzas, Y. Saeys, I. Inza, M. Garc\u00eda-Torres, C. Bielza, Y.V. de Peer, P. Larra\u00f1aga: Peakbin selection in mass spectrometry data using a\u00a0consensus approach with estimation of distribution algorithms, IEEE\/ACM Trans. Comput. Biol. Bioinform. 8(3), 760\u2013774 (2011)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"45_CR10","first-page":"346","volume-title":"Genet. Evol. Comput. Conf.","author":"J. Bacardit","year":"2007","unstructured":"J. Bacardit, M. Stout, J.D. Hirst, K. Sastry, X. Llor\u00e0, N. Krasnogor: Automated alphabet reduction method with evolutionary algorithms for protein structure prediction, Genet. Evol. Comput. Conf. (2007) pp. 346\u2013353"},{"issue":"8","key":"45_CR11","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s10822-005-9015-1","volume":"19","author":"I. Belda","year":"2005","unstructured":"I. Belda, S. Madurga, X. Llor\u00e0, M. Martinell, T. Tarrag\u00f3, M.G. Piqueras, E. Nicol\u00e1s, E. Giralt: ENPDA: An evolutionary structure-based de novo peptide design algorithm, J. Comput. Aided Mol. Des. 19(8), 585\u2013601 (2005)","journal-title":"J. Comput. Aided Mol. Des."},{"key":"45_CR12","unstructured":"Y. Chen, T.L. Yu, K. Sastry, D.E. Goldberg: A\u00a0survey of genetic linkage learning techniques. IlliGAL Rep. No.\u00a02007014 (University of Illinois, Urbana 2007)"},{"key":"45_CR13","first-page":"177","volume-title":"Knowledge Incorporation in Evolutionary Computation","author":"E. Ducheyne","year":"2004","unstructured":"E. Ducheyne, B. De Baets, R. De Wulf: Probabilistic models for linkage learning in forest management. In: Knowledge Incorporation in Evolutionary Computation, ed. by Y. Jin (Springer, Berlin, Heidelberg 2004) pp. 177\u2013194"},{"issue":"3","key":"45_CR14","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1002\/cplx.20168","volume":"12","author":"D.E. Goldberg","year":"2007","unstructured":"D.E. Goldberg, K. Sastry, X. Llor\u00e0: Toward routine billion-variable optimization using genetic algorithms, Complexity 12(3), 27\u201329 (2007)","journal-title":"Complexity"},{"key":"45_CR15","first-page":"531","volume-title":"Genet. Evol. Comput. Conf.","author":"P. Lipinski","year":"2007","unstructured":"P. Lipinski: ECGA vs. BOA in discovering stock market trading experts, Genet. Evol. Comput. Conf. (2007) pp. 531\u2013538"},{"issue":"5","key":"45_CR16","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1016\/j.advwatres.2008.01.017","volume":"31","author":"J.B. Kollat","year":"2008","unstructured":"J.B. Kollat, P.M. Reed, J.R. Kasprzyk: A\u00a0new epsilon-dominance hierarchical Bayesian optimization algorithm for large multi-objective monitoring network design problems, Adv. Water Resour. 31(5), 828\u2013845 (2008)","journal-title":"Adv. Water Resour."},{"key":"45_CR17","volume-title":"5th Bienn. Meet. Int. Congr. Environ. Model. Soft. Model. Environ. Sake","author":"P.M. Reed","year":"2010","unstructured":"P.M. Reed, R. Shah, J.B. Kollat: Assessing the value of environmental observations in a\u00a0changing world: Nonstationarity, complexity, and hierarchical dependencies, 5th Bienn. Meet. Int. Congr. Environ. Model. Soft. Model. Environ. Sake (2010)"},{"issue":"4","key":"45_CR18","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1109\/TEVC.2007.906095","volume":"12","author":"R. Santana","year":"2008","unstructured":"R. Santana, P. Larra\u00f1aga, J.A. Lozano: Protein folding in simplified models with estimation of distribution algorithms, IEEE Trans. Evol. Comput. 12(4), 418\u2013438 (2008)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"9-10","key":"45_CR19","doi-asserted-by":"publisher","first-page":"990","DOI":"10.1016\/j.mcm.2005.05.024","volume":"43","author":"S. Santarelli","year":"2006","unstructured":"S. Santarelli, T.L. Yu, D.E. Goldberg, E.E. Altshuler, T. O'Donnell, H. Southall, R. Mailloux: Military antenna design using simple and competent genetic algorithms, Math. Comput. Model. 43(9-10), 990\u20131022 (2006)","journal-title":"Math. Comput. Model."},{"issue":"3","key":"45_CR20","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1016\/j.ejor.2011.01.030","volume":"211","author":"R. Shah","year":"2011","unstructured":"R. Shah, P. Reed: Comparative analysis of multiobjective evolutionary algorithms for random and correlated instances of multiobjective d-dimensional knapsack problems, Eur. J. Oper. Res. 211(3), 466\u2013479 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"45_CR21","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1142\/S1469026808002235","volume":"7","author":"J. Sun","year":"2007","unstructured":"J. Sun, Q. Zhang, J. Li, X. Yao: A\u00a0hybrid EDA for CDMA cellular system design, Int. J. Comput. Intell. Appl. 7(2), 187\u2013200 (2007)","journal-title":"Int. J. Comput. Intell. Appl."},{"key":"45_CR22","doi-asserted-by":"publisher","volume-title":"Hierarchical Bayesian Optimization Algorithm: Toward a\u00a0New Generation of Evolutionary Algorithms","author":"M. Pelikan","year":"2005","unstructured":"M. Pelikan: Hierarchical Bayesian Optimization Algorithm: Toward a\u00a0New Generation of Evolutionary Algorithms (Springer, Berlin, Heidelberg 2005)","DOI":"10.1007\/b10910"},{"key":"45_CR23","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-540-87700-4_42","volume":"5199","author":"M.W. Hauschild","year":"2008","unstructured":"M.W. Hauschild, M. Pelikan: Enhancing efficiency of hierarchical BOA via distance-based model restrictions, Lect. Notes Comput. Sci. 5199, 417\u2013427 (2008)","journal-title":"Lect. Notes Comput. Sci."},{"issue":"1","key":"45_CR24","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1162\/EVCO_a_00056","volume":"20","author":"M.W. Hauschild","year":"2012","unstructured":"M.W. Hauschild, M. Pelikan, K. Sastry, D.E. Goldberg: Using previous models to bias structural learning in the hierarchical BOA, Evol. Comput. 20(1), 135\u2013160 (2012)","journal-title":"Evol. Comput."},{"issue":"4","key":"45_CR25","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","volume":"9","author":"E.L. Lawler","year":"1963","unstructured":"E.L. Lawler: The quadratic assignment problem, Manag. Sci. 9(4), 586\u2013599 (1963)","journal-title":"Manag. Sci."},{"key":"45_CR26","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"D.E. Goldberg: Genetic Algorithms in Search, Optimization, and Machine Learning (Addison-Wesley, Reading 1989)"},{"key":"45_CR27","volume-title":"Adaptation in Natural and Artificial Systems","author":"J.H. Holland","year":"1975","unstructured":"J.H. Holland: Adaptation in Natural and Artificial Systems (University of Michigan, Ann Arbor 1975)"},{"key":"45_CR28","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V. \u010cern\u00fd","year":"1985","unstructured":"V. \u010cern\u00fd: Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm, J. Optim. Theory Appl. 45, 41\u201351 (1985), 10.1007\/BF00940812","journal-title":"J. Optim. Theory Appl."},{"key":"45_CR29","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick, C.D. Gelatt, M.P. Vecchi: Optimization by simulated annealing, Science 220, 671\u2013680 (1983)","journal-title":"Science"},{"key":"45_CR30","unstructured":"E. Cant\u00fa-Paz: Comparing selection methods of evolutionary algorithms using the distribution of fitness, Tech. Rep. UCRL-JC-138582 (University of California, San Francisco 2000)"},{"key":"45_CR31","first-page":"69","volume":"1","author":"D.E. Goldberg","year":"1991","unstructured":"D.E. Goldberg, K. Deb: A\u00a0comparative analysis of selection schemes used in genetic algorithms, Found. Genet. Algorithms 1, 69\u201393 (1991)","journal-title":"Found. Genet. Algorithms"},{"key":"45_CR32","volume-title":"Introduction to Evolutionary Computing","author":"A.E. Eiben","year":"2010","unstructured":"A.E. Eiben, J.E. Smith: Introduction to Evolutionary Computing (Springer, Berlin, Heidelberg 2010)"},{"key":"45_CR33","unstructured":"A. Juels, S. Baluja, A. Sinclair: The equilibrium genetic algorithm and the role of crossover, Unpublished manuscript (1993)"},{"key":"45_CR34","first-page":"523","volume-title":"Int. Conf. Evol. Comput.","author":"G.R. Harik","year":"1998","unstructured":"G.R. Harik, F.G. Lobo, D.E. Goldberg: The compact genetic algorithm, Int. Conf. Evol. Comput. (1998) pp. 523\u2013528"},{"key":"45_CR35","first-page":"30","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"S. Baluja","year":"1997","unstructured":"S. Baluja, S. Davies: Using optimal dependency-trees for combinatorial optimization: Learning the structure of the search space, Proc. Int. Conf. Mach. Learn. (1997) pp. 30\u201338"},{"key":"45_CR36","first-page":"424","volume":"9","author":"J.S. Bonet De","year":"1997","unstructured":"J.S. De Bonet, C.L. Isbell, P. Viola: MIMIC: Finding optima by estimating probability densities, Adv. Neural Inf. Proc. Syst. 9, 424\u2013431 (1997)","journal-title":"Adv. Neural Inf. Proc. Syst."},{"issue":"4","key":"45_CR37","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1162\/evco.1999.7.4.353","volume":"7","author":"H. M\u00fchlenbein","year":"1999","unstructured":"H. M\u00fchlenbein, T. Mahnig: FDA \u2013 A\u00a0scalable evolutionary algorithm for the optimization of additively decomposed functions, Evol. Comput. 7(4), 353\u2013376 (1999)","journal-title":"Evol. Comput."},{"key":"45_CR38","volume-title":"1st On-line Workshop Soft Comput.","author":"S. Rudlof","year":"1996","unstructured":"S. Rudlof, M. K\u00f6ppen: Stochastic hill climbing with learning by vectors of normal distributions, 1st On-line Workshop Soft Comput. (Nagoya, Japan 1996)"},{"key":"45_CR39","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/BFb0056884","volume":"1498","author":"M. Sebag","year":"1998","unstructured":"M. Sebag, A. Ducoulombier: Extending population-based incremental learning to continuous search spaces, Lect. Notes Comput. Sci. 1498, 418\u2013427 (1998)","journal-title":"Lect. Notes Comput. Sci."},{"key":"45_CR40","first-page":"521","volume-title":"Advances in Soft Computing\u2014Engineering Design and Manufacturing","author":"M. Pelikan","year":"1999","unstructured":"M. Pelikan, H. M\u00fchlenbein: The bivariate marginal distribution algorithm. In: Advances in Soft Computing\u2014Engineering Design and Manufacturing, ed. by R. Roy, T. Furuhashi, P.K. Chawdhry (Springer, Berlin, Heidelberg 1999) pp. 521\u2013535"},{"key":"45_CR41","first-page":"332","volume-title":"2nd Symp. Artif. Intell.","author":"R. Etxeberria","year":"1999","unstructured":"R. Etxeberria, P. Larra\u00f1aga: Global optimization using Bayesian networks, 2nd Symp. Artif. Intell. (1999) pp. 332\u2013339"},{"key":"45_CR42","unstructured":"M. Pelikan, D.E. Goldberg, E. Cant\u00fa-Paz: Linkage problem, distribution estimation, and Bayesian networks. IlliGAL Rep. No.\u00a098013 (University of Illinois, Urbana 1998)"},{"key":"45_CR43","first-page":"525","volume-title":"Genet. Evol. Comput. Conf.","author":"M. Pelikan","year":"1999","unstructured":"M. Pelikan, D.E. Goldberg, E. Cant\u00fa-Paz: BOA: The Bayesian optimization algorithm, Genet. Evol. Comput. Conf. (1999) pp. 525\u2013532"},{"key":"45_CR44","first-page":"511","volume-title":"Genet. Evol. Comput. Conf.","author":"M. Pelikan","year":"2001","unstructured":"M. Pelikan, D.E. Goldberg: Escaping hierarchical traps with competent genetic algorithms, Genet. Evol. Comput. Conf. (2001) pp. 511\u2013518"},{"key":"45_CR45","unstructured":"G. Harik: Linkage learning via probabilistic modeling in the ECGA. IlliGAL Rep. No.\u00a099010 (University of Illinois, Urbana 1999)"},{"key":"45_CR46","first-page":"232","volume-title":"IEEE Congr. Evol. Comput.","author":"M. Soto","year":"2000","unstructured":"M. Soto, A. Ochoa: A\u00a0factorized distribution algorithm based on polytrees, IEEE Congr. Evol. Comput. (2000) pp. 232\u2013237"},{"key":"45_CR47","first-page":"197","volume-title":"Workshop Proc. Genet. Evol. Comput. Conf.","author":"P.A.N. Bosman","year":"2000","unstructured":"P.A.N. Bosman, D. Thierens: Continuous iterated density estimation evolutionary algorithms within the IDEA framework, Workshop Proc. Genet. Evol. Comput. Conf. (2000) pp. 197\u2013200"},{"key":"45_CR48","first-page":"201","volume-title":"Workshop Proc. Genet. Evol. Comput. Conf.","author":"P. Larra\u00f1aga","year":"2000","unstructured":"P. Larra\u00f1aga, R. Etxeberria, J.A. Lozano, J.M. Pena: Optimization in continuous domains by learning and simulation of Gaussian networks, Workshop Proc. Genet. Evol. Comput. Conf. (2000) pp. 201\u2013204"},{"key":"45_CR49","first-page":"840","volume-title":"Genet. Evol. Comput. Conf.","author":"C.W. Ahn","year":"2004","unstructured":"C.W. Ahn, R.S. Ramakrishna, D.E. Goldberg: Real-coded Bayesian optimization algorithm: Bringing the strength of BOA into the continuous world, Genet. Evol. Comput. Conf. (2004) pp. 840\u2013851"},{"issue":"3-4","key":"45_CR50","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10710-010-9109-y","volume":"11","author":"R.I. McKay","year":"2010","unstructured":"R.I. McKay, N.X. Hoai, P.A. Whigham, Y. Shan, M. O'Neill: Grammar-based genetic programming: A\u00a0survey, Genet. Progr. Evol. Mach. 11(3-4), 365\u2013396 (2010)","journal-title":"Genet. Progr. Evol. Mach."},{"key":"45_CR51","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-540-30217-9_20","volume":"3242","author":"P.A.N. Bosman","year":"2004","unstructured":"P.A.N. Bosman, E.D. de Jong: Learning probabilistic tree grammars for genetic programming, Lect. Notes Comput. Sci. 3242, 192\u2013201 (2004)","journal-title":"Lect. Notes Comput. Sci."},{"key":"45_CR52","series-title":"Ph.D. Thesis","volume-title":"Program Distribution Estimation with Grammar Models","author":"Y. Shan","year":"2005","unstructured":"Y. Shan: Program Distribution Estimation with Grammar Models, Ph.D. Thesis (Wuhan Cehui Technical University, China 2005)"},{"key":"45_CR53","first-page":"1043","volume-title":"IEEE Congr. Evol. Comput.","author":"Y. Hasegawa","year":"2007","unstructured":"Y. Hasegawa, H. Iba: Estimation of distribution algorithm based on probabilistic grammar with latent annotations, IEEE Congr. Evol. Comput. (2007) pp. 1043\u20131050"},{"key":"45_CR54","first-page":"429","volume-title":"Genet. Evol. Comput. Conf.","author":"M. Looks","year":"2006","unstructured":"M. Looks: Levels of abstraction in modeling and sampling: The feature-based Bayesian optimization algorithm, Genet. Evol. Comput. Conf. (2006) pp. 429\u2013430"},{"key":"45_CR55","first-page":"519","volume-title":"Genet. Evol. Comput. Conf.","author":"M. Pelikan","year":"2001","unstructured":"M. Pelikan, D.E. Goldberg, K. Sastry: Bayesian optimization algorithm, decision graphs, and Occam's razor, Genet. Evol. Comput. Conf. (2001) pp. 519\u2013526"},{"key":"45_CR56","first-page":"227","volume-title":"2nd Euro-Int. Symp. Comput. Intell.","author":"J. Ocenasek","year":"2002","unstructured":"J. Ocenasek, J. Schwarz: Estimation of distribution algorithm for mixed continuous-discrete optimization problems, 2nd Euro-Int. Symp. Comput. Intell. (2002) pp. 227\u2013232"},{"key":"45_CR57","first-page":"389","volume-title":"Genet. Evol. Comput. Conf.","author":"P.A.N. Bosman","year":"2009","unstructured":"P.A.N. Bosman: On empirical memory design, faster selection of Bayesian factorizations and parameter-free Gaussian EDAs, Genet. Evol. Comput. Conf. (2009) pp. 389\u2013396"},{"key":"45_CR58","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/3-540-45356-3_38","volume":"1517","author":"M. Pelikan","year":"2000","unstructured":"M. Pelikan, D.E. Goldberg: Genetic algorithms, clustering, and the breaking of symmetry, Lect. Notes Comput. Sci. 1517, 385\u2013394 (2000)","journal-title":"Lect. Notes Comput. Sci."},{"key":"45_CR59","first-page":"663","volume-title":"Genet. Evol. Comput. Conf.","author":"D. Thierens","year":"2001","unstructured":"D. Thierens, P.A.N. Bosman: Multi-objective mixture-based iterated density estimation evolutionary algorithms, Genet. Evol. Comput. Conf. (2001) pp. 663\u2013670"},{"key":"45_CR60","first-page":"663","volume-title":"Genet. Evol. Comput. Conf.","author":"M. Pelikan","year":"2005","unstructured":"M. Pelikan, K. Sastry, D.E. Goldberg: Multiobjective hBOA, clustering, and scalability, Genet. Evol. Comput. Conf. (2005) pp. 663\u2013670"},{"key":"45_CR61","first-page":"230","volume-title":"Workshop Proc. Genet. Evol. Comput. Conf.","author":"S. Tsutsui","year":"2001","unstructured":"S. Tsutsui, M. Pelikan, D.E. Goldberg: Evolutionary algorithm using marginal histogram models in continuous domain, Workshop Proc. Genet. Evol. Comput. Conf. (2001) pp. 230\u2013233"},{"key":"45_CR62","first-page":"24","volume":"43","author":"S. Tsutsui","year":"2002","unstructured":"S. Tsutsui, M. Pelikan, D.E. Goldberg: Probabilistic model-building genetic algorithms using histogram models in continuous domain, J. Inf. Process. Soc. Jpn. 43, 24\u201334 (2002)","journal-title":"J. Inf. Process. Soc. Jpn."},{"key":"45_CR63","unstructured":"S. Tsutsui, M. Pelikan, D.E. Goldberg: Node histogram vs. edge histogram: A\u00a0comparison of pmbgas in permutation domains. MEDAL Rep. No.\u00a02006009 (University of Missouri, St. Louis 2006)"},{"key":"45_CR64","first-page":"773","volume":"6","author":"V. Kvasnicka","year":"1996","unstructured":"V. Kvasnicka, M. Pelikan, J. Pospichal: Hill climbing with learning (An abstraction of genetic algorithm), Neural Netw. World 6, 773\u2013796 (1996)","journal-title":"Neural Netw. World"},{"issue":"3","key":"45_CR65","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1162\/evco.1997.5.3.303","volume":"5","author":"H. M\u00fchlenbein","year":"1997","unstructured":"H. M\u00fchlenbein: The equation for response to selection and its use for prediction, Evol. Comput. 5(3), 303\u2013346 (1997)","journal-title":"Evol. Comput."},{"issue":"4","key":"45_CR66","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1109\/4235.797971","volume":"3","author":"G.R. Harik","year":"1999","unstructured":"G.R. Harik, F.G. Lobo, D.E. Goldberg: The compact genetic algorithm, IEEE Trans. Evol. Comput. 3(4), 287\u2013297 (1999)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"45_CR67","series-title":"Ph.D. Thesis","volume-title":"Analysis and design of genetic algorithms","author":"D. Thierens","year":"1995","unstructured":"D. Thierens: Analysis and design of genetic algorithms, Ph.D. Thesis (Katholieke Universiteit Leuven, Leuven 1995)"},{"issue":"4","key":"45_CR68","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1162\/evco.1999.7.4.331","volume":"7","author":"D. Thierens","year":"1999","unstructured":"D. Thierens: Scalability problems of simple genetic algorithms, Evol. Comput. 7(4), 331\u2013352 (1999)","journal-title":"Evol. Comput."},{"key":"45_CR69","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1214\/aoms\/1177729694","volume":"22","author":"S. Kullback","year":"1951","unstructured":"S. Kullback, R.A. Leibler: On information and sufficiency, Ann. Math. Stats. 22, 79\u201386 (1951)","journal-title":"Ann. Math. Stats."},{"key":"45_CR70","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R. Prim","year":"1957","unstructured":"R. Prim: Shortest connection networks and some generalizations, Bell Syst. Tech. J. 36, 1389\u20131401 (1957)","journal-title":"Bell Syst. Tech. J."},{"key":"45_CR71","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/TIT.1968.1054142","volume":"14","author":"C. Chow","year":"1968","unstructured":"C. Chow, C. Liu: Approximating discrete probability distributions with dependence trees, IEEE Trans. Inf. Theory 14, 462\u2013467 (1968)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"45_CR72","volume-title":"Nonparametric and Distribution. Free Methods for the Social Sciences","author":"L.A. Marascuilo","year":"1977","unstructured":"L.A. Marascuilo, M. McSweeney: Nonparametric and Distribution. Free Methods for the Social Sciences (Brooks\/Cole, Monterey 1977)"},{"key":"45_CR73","first-page":"60","volume-title":"Genet. Evol. Comput. Conf.","author":"P.A.N. Bosman","year":"1999","unstructured":"P.A.N. Bosman, D. Thierens: Linkage information processing in distribution estimation algorithms, Genet. Evol. Comput. Conf. (1999) pp. 60\u201367"},{"key":"45_CR74","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1023\/A:1009689913453","volume":"5","author":"H. M\u00fchlenbein","year":"1999","unstructured":"H. M\u00fchlenbein, T. Mahnig, A.O. Rodriguez: Schemata, distributions and graphical models in evolutionary optimization, J. Heuristics 5, 215\u2013247 (1999)","journal-title":"J. Heuristics"},{"key":"45_CR75","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J.J. Rissanen","year":"1978","unstructured":"J.J. Rissanen: Modelling by shortest data description, Automatica 14, 465\u2013471 (1978)","journal-title":"Automatica"},{"key":"45_CR76","volume-title":"Stochastic Complexity in Statistical Inquiry","author":"J.J. Rissanen","year":"1989","unstructured":"J.J. Rissanen: Stochastic Complexity in Statistical Inquiry (World Scientific, Singapore 1989)"},{"issue":"1","key":"45_CR77","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/18.481776","volume":"42","author":"J.J. Rissanen","year":"1996","unstructured":"J.J. Rissanen: Fisher information and stochastic complexity, IEEE Trans. Inf. Theory 42(1), 40\u201347 (1996)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"45_CR78","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1214\/aos\/1176344136","volume":"6","author":"G. Schwarz","year":"1978","unstructured":"G. Schwarz: Estimating the dimension of a\u00a0model, Ann. Stat. 6, 461\u2013464 (1978)","journal-title":"Ann. Stat."},{"key":"45_CR79","unstructured":"K. Sastry, D.E. Goldberg: On extended compact genetic algorithm. IlliGAL Rep. No.\u00a02000026 (University of Illinois, Urbana 2000)"},{"key":"45_CR80","unstructured":"K. Sastry: Efficient atomic cluster optimization using a\u00a0hybrid extended compact genetic algorithm with seeded population. IlliGAL Rep. No.\u00a02001018 (University of Illinois, Urbana 2001)"},{"issue":"5","key":"45_CR81","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1080\/10426910701319654","volume":"22","author":"K. Sastry","year":"2007","unstructured":"K. Sastry, D.E. Goldberg, D.D. Johnson: Scalability of a\u00a0hybrid extended compact genetic algorithm for ground state optimization of clusters, Mater. Manuf. Process. 22(5), 570\u2013576 (2007)","journal-title":"Mater. Manuf. Process."},{"key":"45_CR82","unstructured":"T.L. Yu, D.E. Goldberg, Y.P. Chen: A\u00a0genetic algorithm design inspired by organizational theory: A\u00a0pilot study of a\u00a0dependency structure matrix driven genetic algorithm. IlliGAL Rep. No.\u00a02003007 (University of Illinois, Urbana 2003)"},{"issue":"4","key":"45_CR83","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1162\/evco.2009.17.4.17409","volume":"17","author":"T.L. Yu","year":"2009","unstructured":"T.L. Yu, D.E. Goldberg, K. Sastry, C.F. Lima, M. Pelikan: Dependency structure matrix, genetic algorithms, and effective recombination, Evol. Comput. 17(4), 595\u2013626 (2009)","journal-title":"Evol. Comput."},{"key":"45_CR84","series-title":"Ph.D. Thesis","volume-title":"A\u00a0matrix approach for finding extrema: Problems with Modularity, Hierarchy, and Overlap","author":"T.L. Yu","year":"2006","unstructured":"T.L. Yu: A\u00a0matrix approach for finding extrema: Problems with Modularity, Hierarchy, and Overlap, Ph.D. Thesis (University of Illinois at Urbana-Champaign, Urbana 2006)"},{"key":"45_CR85","first-page":"309","volume":"9","author":"G.F. Cooper","year":"1992","unstructured":"G.F. Cooper, E.H. Herskovits: A\u00a0Bayesian method for the induction of probabilistic networks from data, Mach. Learn. 9, 309\u2013347 (1992)","journal-title":"Mach. Learn."},{"key":"45_CR86","doi-asserted-by":"crossref","unstructured":"D. Heckerman, D. Geiger, D. M. Chickering: Learning\nBayesian networks: The combination of knowledge and statistical data, Tech. Rep. MSR-TR-94-09 (Microsoft Research, Redmond 1994)","DOI":"10.1016\/B978-1-55860-332-5.50042-0"},{"issue":"3","key":"45_CR87","first-page":"197","volume":"20","author":"D. Heckerman","year":"1995","unstructured":"D. Heckerman, D. Geiger, D.M. Chickering: Learning bayesian networks: The combination of knowledge and statistical data, Mach. Learn. 20(3), 197\u2013243 (1995)","journal-title":"Mach. Learn."},{"key":"45_CR88","unstructured":"M. Pelikan, D. E. Goldberg: A\u00a0comparative study of scoring metrics in the Bayesian optimization algorithm: Minimum description length and Bayesian-Dirichlet. Unpublished Tech. Rep. (2000)"},{"key":"45_CR89","first-page":"413","volume-title":"Genet. Evol. Comput. Conf.","author":"M.W. Hauschild","year":"2009","unstructured":"M.W. Hauschild, M. Pelikan: Intelligent bias of network structures in the hierarchical BOA, Genet. Evol. Comput. Conf. (2009) pp. 413\u2013420"},{"key":"45_CR90","first-page":"51","volume-title":"Proc. 4th Jt. Conf. Knowl.-Based Softw. Eng.","author":"J. Schwarz","year":"2000","unstructured":"J. Schwarz, J. Ocenasek: A\u00a0problem-knowledge based evolutionary algorithm KBOA for hypergraph partitioning, Proc. 4th Jt. Conf. Knowl.-Based Softw. Eng. (2000) pp. 51\u201358"},{"key":"45_CR91","first-page":"469","volume-title":"Proc. 15th Natl. Conf. Artif. Intell.","author":"S. Baluja","year":"1998","unstructured":"S. Baluja, S. Davies: Fast probabilistic modeling for combinatorial optimization, Proc. 15th Natl. Conf. Artif. Intell. (1998) pp. 469\u2013476"},{"key":"45_CR92","first-page":"455","volume-title":"Genet. Evol. Comput. Conf.","author":"M. Pelikan","year":"2008","unstructured":"M. Pelikan, K. Sastry, D.E. Goldberg: iBOA: The incremental Bayesian optimization algorithm, Genet. Evol. Comput. Conf. (2008) pp. 455\u2013462"},{"key":"45_CR93","first-page":"24","volume-title":"Int. Conf. Genet. Algorith.","author":"G.R. Harik","year":"1995","unstructured":"G.R. Harik: Finding multimodal solutions using restricted tournament selection, Int. Conf. Genet. Algorith. (1995) pp. 24\u201331"},{"key":"45_CR94","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BFb0056853","volume":"1498","author":"R.A. Watson","year":"1998","unstructured":"R.A. Watson, G.S. Hornby, J.B. Pollack: Modeling building-block interdependency, Lect. Notes Comput. Sci. 1498, 97\u2013106 (1998)","journal-title":"Lect. Notes Comput. Sci."},{"issue":"1","key":"45_CR95","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1162\/1063656053583496","volume":"13","author":"R. Santana","year":"2005","unstructured":"R. Santana: Estimation of distribution algorithms with Kikuchi approximations, Evol. Comput. 13(1), 67\u201397 (2005)","journal-title":"Evol. Comput."},{"key":"45_CR96","first-page":"479","volume-title":"IEEE Congr. Evol. Comput.","author":"S. Shakya","year":"2009","unstructured":"S. Shakya, A.E.I. Brownlee, J.A.W. McCall, F.A. Fournier, G. Owusu: A\u00a0fully multivariate DEUM algorithm, IEEE Congr. Evol. Comput. (2009) pp. 479\u2013486"},{"key":"45_CR97","series-title":"Ph.D. Thesis","volume-title":"DEUM: A\u00a0Framework for an Estimation of Distribution Algorithm based on Markov Random Fields","author":"S.K. Shakya","year":"2006","unstructured":"S.K. Shakya: DEUM: A\u00a0Framework for an Estimation of Distribution Algorithm based on Markov Random Fields, Ph.D. Thesis (Robert Gordon University, Aberdeen 2006)"},{"key":"45_CR98","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1007\/3-540-45356-3_81","volume":"1917","author":"B.T. Zhang","year":"2000","unstructured":"B.T. Zhang, S.Y. Shin: Bayesian evolutionary optimization using Helmholtz machines, Lect. Notes Comput. Sci. 1917, 827\u2013836 (2000)","journal-title":"Lect. Notes Comput. Sci."},{"key":"45_CR99","first-page":"1275","volume-title":"Gene. Evol. Comput. Conf.","author":"M. Pelikan","year":"2003","unstructured":"M. Pelikan, D.E. Goldberg: Hierarchical BOA solves Ising spin glasses and maxsat, Gene. Evol. Comput. Conf. (2003) pp. 1275\u20131286"},{"key":"45_CR100","doi-asserted-by":"publisher","volume-title":"Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications","author":"M. Pelikan","year":"2006","unstructured":"M. Pelikan, A.K. Hartmann: Searching for ground states of Ising spin glasses with hierarchical BOA and cluster exact approximation. In: Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications, ed. by E. Cant\u00fa-Paz, M. Pelikan, K. Sastry (Springer, Berlin, Heidelberg 2006)","DOI":"10.1007\/978-3-540-34954-9"},{"key":"45_CR101","first-page":"908","volume-title":"IEEE Congr. Evol. Comput.","author":"S.K. Shakya","year":"2006","unstructured":"S.K. Shakya, J.A. McCall, D.F. Brown: Solving the Ising spin glass problem using a\u00a0bivariate EDA based on Markov random fields, IEEE Congr. Evol. Comput. (2006) pp. 908\u2013915"},{"issue":"3","key":"45_CR102","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0888-613X(02)00093-2","volume":"31","author":"H. M\u00fchlenbein","year":"2002","unstructured":"H. M\u00fchlenbein, T. Mahnig: Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning, Int. J. Approx. Reason. 31(3), 157\u2013192 (2002)","journal-title":"Int. J. Approx. Reason."},{"key":"45_CR103","first-page":"124","volume-title":"Int. Conf. Soft Comput.","author":"J. Schwarz","year":"1999","unstructured":"J. Schwarz, J. Ocenasek: Experimental study: Hypergraph partitioning based on the simple and advanced algorithms BMDA and BOA, Int. Conf. Soft Comput. (1999) pp. 124\u2013130"},{"key":"45_CR104","unstructured":"F. Rothlauf, D.E. Goldberg, A. Heinzl: Bad codings and the utility of well-designed genetic algorithms. IlliGAL Rep. No.\u00a0200007 (University of Illinois, Urbana 2000)"},{"key":"45_CR105","first-page":"2149","volume-title":"IEEE Congr. Evol. Comput.","author":"J. Li","year":"2003","unstructured":"J. Li, U. Aickelin: A\u00a0Bayesian optimization algorithm for the nurse scheduling problem, IEEE Congr. Evol. Comput. (2003) pp. 2149\u20132156"},{"key":"45_CR106","volume-title":"Proc. Water Resour. Plan. Manag. Conf.","author":"R. Arst","year":"2002","unstructured":"R. Arst, B.S. Minsker, D.E. Goldberg: Comparing advanced genetic algorithms and simple genetic algorithms for groundwater management, Proc. Water Resour. Plan. Manag. Conf. (2002)"},{"key":"45_CR107","volume-title":"Proc. World Water Environ. Resour. Congr. 2005","author":"M.S. Hayes","year":"2005","unstructured":"M.S. Hayes, B.S. Minsker: Evaluation of advanced genetic algorithms applied to groundwater remediation design, Proc. World Water Environ. Resour. Congr. 2005 (2005)"},{"key":"45_CR108","first-page":"213","volume-title":"Workshop Proc. Genet. Evol. Comput. Conf.","author":"E. Cant\u00fa-Paz","year":"2001","unstructured":"E. Cant\u00fa-Paz: Supervised and unsupervised discretization methods for evolutionary algorithms, Workshop Proc. Genet. Evol. Comput. Conf. (2001) pp. 213\u2013216"},{"issue":"2","key":"45_CR109","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1162\/evco.2010.18.2.18202","volume":"18","author":"Y.P. Chen","year":"2010","unstructured":"Y.P. Chen, C.H. Chen: Enabling the extended compact genetic algorithm for real-parameter optimization by using adaptive discretization, Evol. Comput. 18(2), 199\u2013228 (2010)","journal-title":"Evol. Comput."},{"issue":"2","key":"45_CR110","first-page":"139","volume":"5","author":"D.E. Goldberg","year":"1991","unstructured":"D.E. Goldberg: Real-coded genetic algorithms, virtual alphabets, and blocking, Complex Syst. 5(2), 139\u2013167 (1991)","journal-title":"Complex Syst."},{"issue":"3-4","key":"45_CR111","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0020-0255(03)00174-9","volume":"156","author":"M. Pelikan","year":"2003","unstructured":"M. Pelikan, K. Sastry, S. Tsutsui: Getting the best of both worlds: Discrete and continuous genetic and evolutionary algorithms in concert, Inf. Sci. 156(3-4), 147\u2013171 (2003)","journal-title":"Inf. Sci."},{"issue":"1","key":"45_CR112","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1162\/1063656053583478","volume":"13","author":"M. Gallagher","year":"2005","unstructured":"M. Gallagher, M. Frean: Population-based continuous optimization, probabilistic modelling and mean shift, Evol. Comput. 13(1), 29\u201342 (2005)","journal-title":"Evol. Comput."},{"key":"45_CR113","volume-title":"Genet. Evol. Comput. Conf.","author":"M. Gallagher","year":"1999","unstructured":"M. Gallagher, M. Frean, T. Downs: Real-valued evolutionary optimization using a\u00a0flexible probability density estimator, Genet. Evol. Comput. Conf. (1999), pp. 840\u2013846 13\u201317"},{"key":"45_CR114","volume-title":"Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution","author":"I. Rechenberg","year":"1973","unstructured":"I. Rechenberg: Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution (Frommann-Holzboog, Stuttgart 1973)"},{"key":"45_CR115","first-page":"57","volume-title":"Int. Conf. Genet. Algorithms","author":"N. Hansen","year":"1995","unstructured":"N. Hansen, A. Ostermeier, A. Gawelczyk: On the adaptation of arbitrary normal mutation distributions in evolution strategies: The generating set adaptation, Int. Conf. Genet. Algorithms (1995) pp. 57\u201364"},{"key":"45_CR116","volume-title":"Evolutionsstrategie '94","author":"I. Rechenberg","year":"1994","unstructured":"I. Rechenberg: Evolutionsstrategie '94 (Frommann-Holzboog, Stuttgart 1994)"},{"key":"45_CR117","doi-asserted-by":"publisher","volume-title":"Numerische Optimierung von Computer\u2013Modellen mittels der Evolutionsstrategie","author":"H.P. Schwefel","year":"1977","unstructured":"H.P. Schwefel: Numerische Optimierung von Computer\u2013Modellen mittels der Evolutionsstrategie (Birkh\u00e4user, Basel, Switzerland 1977)","DOI":"10.1007\/978-3-0348-5927-1"},{"key":"45_CR118","unstructured":"P.A.N. Bosman, D. Thierens: Mixed IDEAs, Tech. Rep. UU-CS-2000-45 (Utrecht University, Utrecht 2000)"},{"key":"45_CR119","unstructured":"N. Khan, D.E. Goldberg, M. Pelikan: Multi-objective Bayesian optimization algorithm. IlliGAL Rep. No.\u00a02002009 (University of Illinois, Urbana 2002)"},{"key":"45_CR120","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-45712-7_29","volume":"2433","author":"M. Laumanns","year":"2002","unstructured":"M. Laumanns, J. Ocenasek: Bayesian optimization algorithms for multi-objective optimization, Lect. Notes Comput. Sci. 2433, 298\u2013307 (2002)","journal-title":"Lect. Notes Comput. Sci."},{"key":"45_CR121","first-page":"69","volume-title":"Proc. Belg.-Neth. Conf. Artif. Intell.","author":"P.A.N. Bosman","year":"2001","unstructured":"P.A.N. Bosman, D. Thierens: Exploiting gradient information in continuous iterated density estimation evolutionary algorithms, Proc. Belg.-Neth. Conf. Artif. Intell. (2001) pp. 69\u201376"},{"key":"45_CR122","first-page":"492","volume-title":"Genet. Evol. Comput. Conf.","author":"P.A.N. Bosman","year":"2007","unstructured":"P.A.N. Bosman, J. Grahl, F. Rothlauf: SDR: A\u00a0better trigger for adaptive variance scaling in normal EDAs, Genet. Evol. Comput. Conf. (2007) pp. 492\u2013499"},{"key":"45_CR123","unstructured":"P. A. N. Bosman, J. Grahl, D. Thierens: AMaLGaM IDEAs in noiseless black-box\n\t\toptimization benchmarking. Black Box Optim. Benchmarking BBOB Workshop\n\t\tGenet. Evol. Comput. Conf., GECCO-2009 (2009) pp.\u00a02247\u20132254"},{"key":"45_CR124","first-page":"2351","volume-title":"Workshop Genet. Evol. Comput. Conf.","author":"P.A.N. Bosman","year":"2009","unstructured":"P.A.N. Bosman, J. Grahl, D. Thierens: AMaLGaM IDEAs in noisy black-box optimization benchmarking, Workshop Genet. Evol. Comput. Conf. (2009) pp. 2351\u20132358"},{"key":"45_CR125","first-page":"137","volume-title":"Proc. Eur. Conf. Artif. Evol.","author":"I. Servet","year":"1997","unstructured":"I. Servet, L. Trave-Massuyes, D. Stern: Telephone network traffic overloading diagnosis and evolutionary computation techniques, Proc. Eur. Conf. Artif. Evol. (1997) pp. 137\u2013144"},{"key":"45_CR126","first-page":"112","volume-title":"Knowl.-Based Intell. Inf. Eng. Syst. Allied Thech.","author":"S. Tsutsui","year":"2001","unstructured":"S. Tsutsui, M. Pelikan, D.E. Goldberg: Probabilistic model-building genetic algorithm using marginal histogram models in continuous domain, Knowl.-Based Intell. Inf. Eng. Syst. Allied Thech. (2001) pp. 112\u2013121"},{"key":"45_CR127","first-page":"512","volume-title":"Genet. Evol. Comput. Conf.","author":"M. Pelikan","year":"2002","unstructured":"M. Pelikan, D.E. Goldberg, S. Tsutsui: Combining the strengths of the Bayesian optimization algorithm and adaptive evolution strategies, Genet. Evol. Comput. Conf. (2002) pp. 512\u2013519"},{"key":"45_CR128","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-540-30217-9_36","volume":"3242","author":"J. Ocenasek","year":"2004","unstructured":"J. Ocenasek, S. Kern, N. Hansen, P. Koumoutsakos: A\u00a0mixed Bayesian optimization algorithm with variance adaptation, Lect. Notes Comput. Sci. 3242, 352\u2013361 (2004)","journal-title":"Lect. Notes Comput. Sci."},{"key":"45_CR129","volume-title":"Genetic programming: On the Programming of Computers by Means of Natural Selection","author":"J.R. Koza","year":"1992","unstructured":"J.R. Koza: Genetic programming: On the Programming of Computers by Means of Natural Selection (MIT, Cambridge 1992)"},{"issue":"2","key":"45_CR130","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1162\/evco.1997.5.2.123","volume":"5","author":"R.P. Salustowicz","year":"1997","unstructured":"R.P. Salustowicz, J. Schmidhuber: Probabilistic incremental program evolution, Evol. Comput. 5(2), 123\u2013141 (1997)","journal-title":"Evol. Comput."},{"key":"45_CR131","first-page":"213","volume-title":"Proc. Eur. Conf. Mach. Learn.","author":"R.P. Salustowicz","year":"1997","unstructured":"R.P. Salustowicz, J. Schmidhuber: Probabilistic incremental program evolution: Stochastic search through program space, Proc. Eur. Conf. Mach. Learn. (1997) pp. 213\u2013220"},{"key":"45_CR132","unstructured":"R. Salustowicz, J. Schmidhuber: H-PIPE: Facilitating hierarchical program evolution through skip nodes, Tech. Rep. IDSIA-08-98 (IDSIA, Lugano 1998)"},{"key":"45_CR133","first-page":"154","volume-title":"Int. Conf. Evol. Comput.","author":"S. Handley","year":"1994","unstructured":"S. Handley: On the use of a\u00a0directed acyclic graph to represent a\u00a0population of computer programs, Int. Conf. Evol. Comput. (1994) pp. 154\u2013159"},{"key":"45_CR134","first-page":"1618","volume-title":"IEEE Congr. Evol. Comput.","author":"K. Yanai","year":"2003","unstructured":"K. Yanai, H. Iba: Estimation of distribution programming based on Bayesian network, IEEE Congr. Evol. Comput. (2003) pp. 1618\u20131625"},{"key":"45_CR135","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-1-4419-8983-3_13","volume-title":"Genetic Programming Theory and Practise","author":"K. Sastry","year":"2003","unstructured":"K. Sastry, D.E. Goldberg: Probabilistic model building and competent genetic programming. In: Genetic Programming Theory and Practise, ed. by R.L. Riolo, B. Worzel (Kluwer Acadamic, Boston 2003) pp. 205\u2013220"},{"key":"45_CR136","first-page":"747","volume-title":"Genet. Evol. Comput. Conf.","author":"M. Looks","year":"2005","unstructured":"M. Looks, B. Goertzel, C. Pennachin: Learning computer programs with the Bayesian optimization algorithm, Genet. Evol. Comput. Conf. (2005) pp. 747\u2013748"},{"key":"45_CR137","series-title":"Ph.D. Thesis","volume-title":"Competent Program Evolution","author":"M. Looks","year":"2006","unstructured":"M. Looks: Competent Program Evolution, Ph.D. Thesis (Washington University, St. Louis 2006)"},{"key":"45_CR138","first-page":"539","volume-title":"Genet. Evol. Comput. Conf.","author":"M. Looks","year":"2007","unstructured":"M. Looks: Scalable estimation-of-distribution program evolution, Genet. Evol. Comput. Conf. (2007) pp. 539\u2013546"},{"key":"45_CR139","first-page":"1639","volume-title":"IEEE Congr. Evol. Comput.","author":"Y. Shan","year":"2003","unstructured":"Y. Shan, R. McKay, H.A. Abbass, D. Essam: Program evolution with explicit learning: A\u00a0new framework for program automatic synthesis, IEEE Congr. Evol. Comput. (2003) pp. 1639\u20131646"},{"key":"45_CR140","first-page":"255","volume-title":"5th Int. Conf. Evol. Artif.","author":"A. Ratle","year":"2001","unstructured":"A. Ratle, M. Sebag: Avoiding the bloat with probabilistic grammar-guided genetic programming, 5th Int. Conf. Evol. Artif. (2001) pp. 255\u2013266"},{"issue":"2","key":"45_CR141","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1162\/106454699568728","volume":"5","author":"M. Dorigo","year":"1999","unstructured":"M. Dorigo, G.D. Caro, L.M. Gambardella: Ant algorithms for discrete optimization, Artif. Life 5(2), 137\u2013172 (1999)","journal-title":"Artif. Life"},{"key":"45_CR142","first-page":"478","volume-title":"IEEE Congr. Evol. Comput.","author":"Y. Shan","year":"2004","unstructured":"Y. Shan, R.I. McKay, R. Baxter: Grammar model-based program evolution, IEEE Congr. Evol. Comput. (2004) pp. 478\u2013485"},{"key":"45_CR143","first-page":"155","volume-title":"Proc. 8th Eur. Conf. Genet. Progr.","author":"I. Tanev","year":"2005","unstructured":"I. Tanev: Incorporating learning probabilistic context-sensitive grammar in genetic programming for efficient evolution and adaptation of snakebot, Proc. 8th Eur. Conf. Genet. Progr. (2005) pp. 155\u2013166"},{"key":"45_CR144","first-page":"377","volume-title":"Advances in Genetic Programming","author":"F. Gruau","year":"1996","unstructured":"F. Gruau: On using syntactic constraints with genetic programming. In: Advances in Genetic Programming, Vol. 2, ed. by P.J. Angeline, K.E. Kinnear Jr. (MIT, Cambridge 1996) pp. 377\u2013394"},{"key":"45_CR145","first-page":"33","volume-title":"Proc. Workshop Genet. Progr. Theory Real-World Appl.","author":"P. Whigham","year":"1995","unstructured":"P. Whigham: Grammatically-based genetic programming, Proc. Workshop Genet. Progr. Theory Real-World Appl. (1995) pp. 33\u201341"},{"issue":"5","key":"45_CR146","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/64.464935","volume":"10","author":"M.L. Wong","year":"1995","unstructured":"M.L. Wong, K.S. Leung: Genetic logic programming and applications, IEEE Expert 10(5), 68\u201376 (1995)","journal-title":"IEEE Expert"},{"issue":"2","key":"45_CR147","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"J.C. Bean","year":"1994","unstructured":"J.C. Bean: Genetic algorithms and random keys for sequencing and optimization, ORSA J. Comput. 6(2), 154\u2013160 (1994)","journal-title":"ORSA J. Comput."},{"key":"45_CR148","first-page":"13","volume-title":"Late-Breaking Pap. Genet. Evol. Comput. Conf.","author":"P.A.N. Bosman","year":"2001","unstructured":"P.A.N. Bosman, D. Thierens: New IDEAs and more ICE by learning and using unconditional permutation factorizations, Late-Breaking Pap. Genet. Evol. Comput. Conf. (2001) pp. 13\u201323"},{"key":"45_CR149","first-page":"227","volume-title":"Estimation of Distribution Algorithms. A\u00a0New Tool for Evolutionary Computation","author":"V. Robles","year":"2002","unstructured":"V. Robles, P. de Miguel, P. Larra\u00f1aga: Solving the traveling salesman problem with edas. In: Estimation of Distribution Algorithms. A\u00a0New Tool for Evolutionary Computation, ed. by P. Larra\u00f1aga, J.A. Lozano (Kluwer Academic, Boston 2002) pp. 227\u2013238"},{"key":"45_CR150","first-page":"219","volume-title":"Genet. Evol. Comput. Conf.","author":"P.A.N. Bosman","year":"2001","unstructured":"P.A.N. Bosman, D. Thierens: Crossing the road to efficient IDEAs for permutation problems, Genet. Evol. Comput. Conf. (2001) pp. 219\u2013226"},{"key":"45_CR151","volume-title":"Proc. CaNew Workshop Conf.","author":"E. Bengoetxea","year":"2000","unstructured":"E. Bengoetxea, P. Larra\u00f1aga, I. Bloch, A. Perchant, C. Boeres: Inexact graph matching using learning and simulation of Bayesian networks, Proc. CaNew Workshop Conf. (2000)"},{"key":"45_CR152","doi-asserted-by":"crossref","unstructured":"M. Pelikan, S. Tsutsui, R. Kalapala: Dependency trees, permutations, and quadratic assignment problem. MEDAL Rep. No. 2007003 (University of Missouri, St. Louis 2007)","DOI":"10.1145\/1276958.1277089"},{"key":"45_CR153","unstructured":"S. Tsutsui, D.E. Goldberg, M. Pelikan: Solving sequence problems by building and sampling edge histograms. IlliGAL Rep. No.\u00a02002024 (University of Illinois, Urbana 2002)"},{"key":"45_CR154","first-page":"570","volume-title":"Genet. Evol. Comput. Conf.","author":"A. Salhi","year":"2007","unstructured":"A. Salhi, J.A.V. Rodr\u00edguez, Q. Zhang: An estimation of distribution algorithm with guided mutation for a\u00a0complex flow shop scheduling problem, Genet. Evol. Comput. Conf. (2007) pp. 570\u2013576"},{"issue":"6","key":"45_CR155","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q. Zhang","year":"2007","unstructured":"Q. Zhang, H. Li: MOEA\/D: A\u00a0multiobjective evolutionary algorithm based on decomposition, IEEE Trans. Evol. Comput. 11(6), 712\u2013731 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"45_CR156","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1109\/TEVC.2004.840835","volume":"9","author":"Q. Zhang","year":"2005","unstructured":"Q. Zhang, J. Sun, E.P.K. Tsang: An evolutionary algorithm with guided mutation for the maximum clique problem, IEEE Trans. Evol. Comput. 9(2), 192\u2013200 (2005)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"45_CR157","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1162\/evco.1993.1.1.25","volume":"1","author":"H. M\u00fchlenbein","year":"1993","unstructured":"H. M\u00fchlenbein, D. Schlierkamp-Voosen: Predictive models for the breeder genetic algorithm I. Continuous parameter optimization, Evol. Comput. 1(1), 25\u201349 (1993)","journal-title":"Evol. Comput."},{"issue":"1","key":"45_CR158","first-page":"19","volume":"7","author":"H. M\u00fchlenbein","year":"1998","unstructured":"H. M\u00fchlenbein, T. Mahnig: Convergence theory and applications of the factorized distribution algorithm, J. Comput. Inf. Tech. 7(1), 19\u201332 (1998)","journal-title":"J. Comput. Inf. Tech."},{"issue":"1","key":"45_CR159","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1109\/TEVC.2003.819431","volume":"8","author":"Q. Zhang","year":"2004","unstructured":"Q. Zhang: On stability of fixed points of limit models of univariate marginal distribution algorithm and factorized distribution algorithm, IEEE Trans. Evol. Comput. 8(1), 80\u201393 (2004)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"12","key":"45_CR160","first-page":"465","volume":"4","author":"C. Gonzalez","year":"2001","unstructured":"C. Gonzalez, J. Lozano, P. Larra\u00f1aga: Analyzing the PBIL algorithm by means of discrete dynamical systems, Complex Syst. 4(12), 465\u2013479 (2001)","journal-title":"Complex Syst."},{"key":"45_CR161","first-page":"1","volume-title":"Int. Conf. Evol. Comput.","author":"M. H\u00f6hfeld","year":"1997","unstructured":"M. H\u00f6hfeld, G. Rudolph: Towards a\u00a0theory of population-based incremental learning, Int. Conf. Evol. Comput. (1997) pp. 1\u20136"},{"key":"45_CR162","first-page":"333","volume":"6","author":"D.E. Goldberg","year":"1992","unstructured":"D.E. Goldberg, K. Deb, J.H. Clark: Genetic algorithms, noise, and the sizing of populations, Complex Syst. 6, 333\u2013362 (1992)","journal-title":"Complex Syst."},{"key":"45_CR163","first-page":"336","volume-title":"Genet. Evol. Comput. Conf.","author":"D.E. Goldberg","year":"2001","unstructured":"D.E. Goldberg, K. Sastry, T. Latoza: On the supply of building blocks, Genet. Evol. Comput. Conf. (2001) pp. 336\u2013342"},{"key":"45_CR164","first-page":"7","volume-title":"Int. Conf. Evol. Comput.","author":"G.R. Harik","year":"1997","unstructured":"G.R. Harik, E. Cant\u00fa-Paz, D.E. Goldberg, B.L. Miller: The gambler's ruin problem, genetic algorithms, and the sizing of populations, Int. Conf. Evol. Comput. (1997) pp. 7\u201312"},{"issue":"3","key":"45_CR165","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1162\/evco.1999.7.3.231","volume":"7","author":"G. Harik","year":"1999","unstructured":"G. Harik, E. Cant\u00fa-Paz, D.E. Goldberg, B.L. Miller: The gambler's ruin problem, genetic algorithms, and the sizing of populations, Evol. Comput. 7(3), 231\u2013253 (1999)","journal-title":"Evol. Comput."},{"issue":"3","key":"45_CR166","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0888-613X(02)00095-6","volume":"31","author":"M. Pelikan","year":"2002","unstructured":"M. Pelikan, K. Sastry, D.E. Goldberg: Scalability of the Bayesian optimization algorithm, Int. J. Approx. Reason. 31(3), 221\u2013258 (2002)","journal-title":"Int. J. Approx. Reason."},{"key":"45_CR167","first-page":"601","volume-title":"Genet. Evol. Comput. Conf.","author":"T.L. Yu","year":"2007","unstructured":"T.L. Yu, K. Sastry, D.E. Goldberg, M. Pelikan: Population sizing for entropy-based model building in estimation of distribution algorithms, Genet. Evol. Comput. Conf. (2007) pp. 601\u2013608"},{"key":"45_CR168","unstructured":"H. M\u00fchlenbein: Convergence of estimation of distribution algorithms for finite samples. Tech. Rep. (Fraunhofer Institut, Sankt Augustin 2008)"},{"key":"45_CR169","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1162\/1063656053583414","volume":"13","author":"J.L. Shapiro","year":"2005","unstructured":"J.L. Shapiro: Drift and scaling in estimation of distribution algorithms, Evol. Comput. 13, 99\u2013123 (2005)","journal-title":"Evol. Comput."},{"key":"45_CR170","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-87700-4_14","volume":"5199","author":"P.A.N. Bosman","year":"2008","unstructured":"P.A.N. Bosman, J. Grahl, D. Thierens: Enhancing the performance of maximum-likelihood Gaussian EDAs using anticipated mean shift, Lect. Notes Comput. Sci. 5199, 133\u2013143 (2008)","journal-title":"Lect. Notes Comput. Sci."},{"key":"45_CR171","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1162\/1063656053583423","volume":"13","author":"Y. Gao","year":"2005","unstructured":"Y. Gao, J. Culberson: Space complexity of estimation of distribution algorithms, Evol. Comput. 13, 125\u2013143 (2005)","journal-title":"Evol. Comput."},{"issue":"6","key":"45_CR172","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1109\/TEVC.2008.2004423","volume":"13","author":"M.W. Hauschild","year":"2009","unstructured":"M.W. Hauschild, M. Pelikan, K. Sastry, C.F. Lima: Analyzing probabilistic models in hierarchical BOA, IEEE Trans. Evol. Comput. 13(6), 1199\u20131217 (2009)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"45_CR173","doi-asserted-by":"publisher","first-page":"1351","DOI":"10.1007\/s00500-010-0675-y","volume":"15","author":"C. Lima","year":"2011","unstructured":"C. Lima, F. Lobo, M. Pelikan, D.E. Goldberg: Model accuracy in the Bayesian optimization algorithm, Soft Comput. 15, 1351\u20131371 (2011)","journal-title":"Soft Comput."},{"key":"45_CR174","first-page":"1","volume":"99","author":"C. Echegoyen","year":"2011","unstructured":"C. Echegoyen, A. Mendiburu, R. Santana, J.A. Lozano: Toward understanding EDAs based on Bayesian networks through a\u00a0quantitative analysis, IEEE Trans. Evol. Comput. 99, 1\u201317 (2011)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"45_CR175","first-page":"303","volume-title":"Genet. Evol. Comput. Conf.","author":"E. Radetic","year":"2010","unstructured":"E. Radetic, M. Pelikan: Spurious dependencies and EDA scalability, Genet. Evol. Comput. Conf. (2010) pp. 303\u2013310"},{"key":"45_CR176","doi-asserted-by":"publisher","volume-title":"The Design of Innovation: Lessons from and for Competent Genetic Algorithms","author":"D.E. Goldberg","year":"2002","unstructured":"D.E. Goldberg: The Design of Innovation: Lessons from and for Competent Genetic Algorithms (Kluwer Academic, Boston 2002)","DOI":"10.1007\/978-1-4757-3643-4"},{"key":"45_CR177","volume-title":"Efficient and Accurate Parallel Genetic Algorithms","author":"E. Cant\u00fa-Paz","year":"2000","unstructured":"E. Cant\u00fa-Paz: Efficient and Accurate Parallel Genetic Algorithms (Kluwer Academic, Boston 2000)"},{"key":"45_CR178","volume-title":"Parallel Estimation of Distribution Algorithms: Principles and Enhancements","author":"J. Ocenasek","year":"2010","unstructured":"J. Ocenasek: Parallel Estimation of Distribution Algorithms: Principles and Enhancements (Lambert Academic, Saarbr\u00fcchen 2010)"},{"key":"45_CR179","first-page":"61","volume-title":"Proc. Eur. Symp. Comput. Intell.","author":"J. Ocenasek","year":"2000","unstructured":"J. Ocenasek, J. Schwarz: The parallel Bayesian optimization algorithm, Proc. Eur. Symp. Comput. Intell. (2000) pp. 61\u201367"},{"key":"45_CR180","series-title":"Ph.D. Thesis","volume-title":"Parallel Estimation of Distribution Algorithms","author":"J. Ocenasek","year":"2002","unstructured":"J. Ocenasek: Parallel Estimation of Distribution Algorithms, Ph.D. Thesis (Brno University of Technology, Brno 2002)"},{"key":"45_CR181","volume-title":"Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications","author":"J. Ocenasek","year":"2006","unstructured":"J. Ocenasek, E. Cant\u00fa-Paz, M. Pelikan, J. Schwarz: Design of parallel estimation of distribution algorithms. In: Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications, ed. by M. Pelikan, K. Sastry, E. Cant\u00fa-Paz (Springer, Berlin, Heidelberg 2006)"},{"key":"45_CR182","first-page":"577","volume-title":"Genet. Evol. Comput. Conf. (GECCO-2007)","author":"K. Sastry","year":"2007","unstructured":"K. Sastry, D.E. Goldberg, X. Llor\u00e0: Towards billion-bit optimization via a\u00a0parallel estimation of distribution algorithm, Genet. Evol. Comput. Conf. (GECCO-2007) (2007) pp. 577\u2013584"},{"key":"45_CR183","first-page":"495","volume":"1","author":"G.E. Hinton","year":"1987","unstructured":"G.E. Hinton, S.J. Nowlan: How learning can guide evolution, Complex Syst. 1, 495\u2013502 (1987)","journal-title":"Complex Syst."},{"key":"45_CR184","unstructured":"A. Sinha, D.E. Goldberg: A\u00a0survey of hybrid genetic and evolutionary algorithms. IlliGAL Rep. No.\u00a02003004 (University of Illinois, Urbana 2003)"},{"key":"45_CR185","volume-title":"Hybrid Evolutionary Algorithms. Studies in Computational Intelligence","year":"2007","unstructured":"C. Grosan, A. Abraham, H. Ishibuchi (Eds.): Hybrid Evolutionary Algorithms. Studies in Computational Intelligence (Springer, Berlin, Heidelberg 2007)"},{"key":"45_CR186","first-page":"437","volume-title":"Genet. Evol. Comput. Conf.","author":"E. Radetic","year":"2009","unstructured":"E. Radetic, M. Pelikan, D.E. Goldberg: Effects of a\u00a0deterministic hill climber on hBOA, Genet. Evol. Comput. Conf. (2009) pp. 437\u2013444"},{"issue":"1","key":"45_CR187","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1109\/TEVC.2010.2051445","volume":"16","author":"P.A.N. Bosman","year":"2012","unstructured":"P.A.N. Bosman: On gradients and hybrid evolutionary algorithms for real-valued multi-objective optimization, IEEE Trans. Evol. Comput. 16(1), 51\u201369 (2012)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"45_CR188","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/11844297_24","volume":"4193","author":"C.F. Lima","year":"2006","unstructured":"C.F. Lima, M. Pelikan, K. Sastry, M.V. Butz, D.E. Goldberg, F.G. Lobo: Substructural neighborhoods for local search in the Bayesian optimization algorithm, Lect. Notes Comput. Sci. 4193, 232\u2013241 (2006)","journal-title":"Lect. Notes Comput. Sci."},{"key":"45_CR189","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-03751-1_5","volume-title":"Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics","author":"C.F. Lima","year":"2009","unstructured":"C.F. Lima, M. Pelikan, F.G. Lobo, D.E. Goldberg: Loopy substructural local search for the Bayesian optimization algorithm. In: Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics, ed. by T. St\u00fctzle, M. Birattari, H.H. Hoos (Springer, Berlin, Heidelberg 2009) pp. 61\u201375"},{"key":"45_CR190","unstructured":"A. Mendiburu, R. Santana, J.A. Lozano: Introducing belief propagation in estimation of distribution algorithms: A\u00a0parallel approach, Tech. Rep. EHU-KAT-IK-11-07 (University of the Basque Country, San Sebasti\u00e1n 2007)"},{"key":"45_CR191","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/978-3-540-24586-5_84","volume":"2905","author":"A. Ochoa","year":"2003","unstructured":"A. Ochoa, R. H\u00fcns, M. Soto, H. M\u00fchlenbein: A\u00a0maximum entropy approach to sampling in EDA, Lect. Notes Comput. Sci. 2905, 683\u2013690 (2003)","journal-title":"Lect. Notes Comput. Sci."},{"key":"45_CR192","first-page":"114","volume-title":"Genet. Evol. Comput. Conf. (GECCO)","author":"K. Sastry","year":"2004","unstructured":"K. Sastry, D.E. Goldberg: Designing competent mutation operators via probabilistic model building of neighborhoods, Genet. Evol. Comput. Conf. (GECCO) (2004) pp. 114\u2013125, Also IlliGAL Rep. No. 2004006"},{"key":"45_CR193","first-page":"1256","volume-title":"Genet. Evol. Comput. Conf.","author":"D. Iclanzan","year":"2007","unstructured":"D. Iclanzan, D. Dumitrescu: Overcoming hierarchical difficulty by hill-climbing the building block structure, Genet. Evol. Comput. Conf. (2007) pp. 1256\u20131263"},{"key":"45_CR194","first-page":"577","volume-title":"Genet. Evol. Comput. Conf.","author":"P. Pos\u00edk","year":"2011","unstructured":"P. Pos\u00edk, S. Van\u00edcek: Parameter-less local optimizer with linkage identification for deterministic order-k decomposable problems, Genet. Evol. Comput. Conf. (2011) pp. 577\u2013584"},{"key":"45_CR195","first-page":"212","volume-title":"Genet. Evol. Comput. Conf.","author":"D.E. Goldberg","year":"1999","unstructured":"D.E. Goldberg: Using time efficiently: Genetic-evolutionary algorithms and the continuation problem, Genet. Evol. Comput. Conf. (1999) pp. 212\u2013219"},{"key":"45_CR196","first-page":"220","volume-title":"Genet. Evol. Comput. Conf.","author":"D.E. Goldberg","year":"1999","unstructured":"D.E. Goldberg, S. Voessner: Optimizing global-local search hybrids, Genet. Evol. Comput. Conf. (1999) pp. 220\u2013228"},{"key":"45_CR197","first-page":"126","volume-title":"Genet. Evol. Comput. Conf. (GECCO)","author":"K. Sastry","year":"2004","unstructured":"K. Sastry, D.E. Goldberg: Let's get ready to rumble: Crossover versus mutation head to head, Genet. Evol. Comput. Conf. (GECCO) (2004) pp. 126\u2013137"},{"key":"45_CR198","first-page":"114","volume-title":"Genet. Evol. Comput. Conf. (GECCO)","author":"K. Sastry","year":"2007","unstructured":"K. Sastry, D.E. Goldberg: Let's get ready to rumble redux: Crossover versus mutation head to head on exponentially scaled problems, Genet. Evol. Comput. Conf. (GECCO) (2007) pp. 114\u2013125, Also IlliGAL Report No. 2004006"},{"key":"45_CR199","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-540-34954-9_9","volume-title":"Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications","author":"S. Baluja","year":"2006","unstructured":"S. Baluja: Incorporating a\u00a0priori knowledge in probabilistic-model based optimization. In: Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications, ed. by E. Cant\u00fa-Paz, M. Pelikan, K. Sastry (Springer, Berlin, Heidelberg 2006) pp. 205\u2013219"},{"key":"45_CR200","doi-asserted-by":"crossref","unstructured":"M. Pelikan, M. Hauschild: Distance-based bias in model-directed optimization of additively decomposable problems. MEDAL Rep. No.\u00a02012001 (University of Missouri, St. Louis 2012)","DOI":"10.1145\/2330163.2330203"},{"key":"45_CR201","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-32937-1_18","volume":"7491","author":"M. Pelikan","year":"2012","unstructured":"M. Pelikan, M. Hauschild, P.L. Lanzi: Transfer learning, soft distance-based bias, and the hierarchical BOA, Lect. Notes Comput. Sci. 7491, 173\u2013183 (2012)","journal-title":"Lect. Notes Comput. Sci."},{"key":"45_CR202","first-page":"48","volume-title":"Genet. Evol. Comput. Conf.","author":"M. Pelikan","year":"2004","unstructured":"M. Pelikan, K. Sastry: Fitness inheritance in the Bayesian optimization algorithm, Genet. Evol. Comput. Conf. (2004) pp. 48\u201359"},{"key":"45_CR203","first-page":"720","volume-title":"IEEE Congr. Evol. Comput.","author":"K. Sastry","year":"2004","unstructured":"K. Sastry, M. Pelikan, D.E. Goldberg: Efficiency enhancement of genetic algorithms via building-block-wise fitness estimation, IEEE Congr. Evol. Comput. (2004) pp. 720\u2013727"},{"key":"45_CR204","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-540-34954-9_7","volume-title":"Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications","author":"K. Sastry","year":"2006","unstructured":"K. Sastry, M. Pelikan, D.E. Goldberg: Efficiency enhancement of estimation of distribution algorithms. In: Scalable Optimization via Probabilistic Modeling: From Algorithms to\n\t\t\tApplications, ed. by E. Cant\u00fa-Paz, M. Pelikan, K. Sastry (Springer, Berlin, Heidelberg 2006) pp. 161\u2013185"},{"issue":"1","key":"45_CR205","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10710-007-9052-8","volume":"9","author":"M. Pelikan","year":"2008","unstructured":"M. Pelikan, K. Sastry, D.E. Goldberg: Sporadic model building for efficiency enhancement of the hierarchical BOA, Genet. Progr. Evol. Mach. 9(1), 53\u201384 (2008)","journal-title":"Genet. Progr. Evol. Mach."},{"key":"45_CR206","first-page":"913","volume-title":"Proc. 13th Annu. Conf. Companion Genet. Evol. Comput.","author":"M. Pelikan","year":"2011","unstructured":"M. Pelikan: Probabilistic model-building genetic algorithms, Proc. 13th Annu. Conf. Companion Genet. Evol. Comput. (2011) pp. 913\u2013940"},{"key":"45_CR207","first-page":"880","volume-title":"IEEE Congr. Evol. Comput.","author":"S. Tsutsui","year":"2005","unstructured":"S. Tsutsui, M. Pelikan, A. Ghosh: Performance of aggregation pheromone system on unimodal and multimodal problems, IEEE Congr. Evol. Comput. (2005) pp. 880\u2013887"},{"key":"45_CR208","first-page":"593","volume-title":"Genet. Evol. Comput. Conf.","author":"C.W. Ahn","year":"2007","unstructured":"C.W. Ahn, R.S. Ramakrishna: Multiobjective real-coded Bayesian optimization algorithm revisited: Diversity preservation, Genet. Evol. Comput. Conf. (2007) pp. 593\u2013600"},{"issue":"1","key":"45_CR209","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/TEVC.2007.894202","volume":"12","author":"Q. Zhang","year":"2008","unstructured":"Q. Zhang, A. Zhou, Y. Jin: RM-MEDA: A\u00a0regularity model-based multiobjective estimation of distribution algorithm, IEEE Trans. Evol. Comput. 12(1), 41\u201363 (2008)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"45_CR210","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/11844297_59","volume":"4193","author":"H. Li","year":"2006","unstructured":"H. Li, Q. Zhang: A\u00a0multiobjective differential evolution based on decomposition for multiobjective optimization with variable linkages, Lect. Notes Comput. Sci. 4193, 583\u2013592 (2006)","journal-title":"Lect. Notes Comput. Sci."}],"container-title":["Springer Handbook of Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43505-2_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T02:42:57Z","timestamp":1559184177000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43505-2_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662435045","9783662435052"],"references-count":210,"URL":"http:\/\/dx.doi.org\/10.1007\/978-3-662-43505-2_45","relation":{},"published":{"date-parts":[[2015]]}}}