{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:19:43Z","timestamp":1725574783686},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262084"},{"type":"electronic","value":"9783540321064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11494669_6","type":"book-chapter","created":{"date-parts":[[2011,1,13]],"date-time":"2011-01-13T14:48:09Z","timestamp":1294930089000},"page":"42-49","source":"Crossref","is-referenced-by-count":2,"title":["Average Time Complexity of Estimation of Distribution Algorithms"],"prefix":"10.1007","author":[{"given":"C.","family":"Gonz\u00e1lez","sequence":"first","affiliation":[]},{"given":"A.","family":"Ram\u00edrez","sequence":"additional","affiliation":[]},{"given":"J. A.","family":"Lozano","sequence":"additional","affiliation":[]},{"given":"P.","family":"Larra\u00f1aga","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-1539-5","volume-title":"Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation","author":"P. Larra\u00f1aga","year":"2002","unstructured":"Larra\u00f1aga, P., Lozano, J.A.: Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0888-613X(02)00095-6","volume":"31","author":"M. Pelikan","year":"2002","unstructured":"Pelikan, M., Sastry, K., Goldberg, D.E.: Scalability of the Bayesian Optimization Algorithm. International Journal of Approximate Reasoning\u00a031, 221\u2013258 (2002)","journal-title":"International Journal of Approximate Reasoning"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0888-613X(02)00093-2","volume":"31","author":"H. M\u00fchlenbein","year":"2002","unstructured":"M\u00fchlenbein, H., Mahnig, T.: Evolutionary Optimization and the Estimation of Search Distributions with Applications to Graph Bipartitioning. International Journal of Approximate Reasoning\u00a031, 157\u2013192 (2002)","journal-title":"International Journal of Approximate Reasoning"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"M\u00fchlenbein, H., Paa\u00df, G.: From Recombination of Genes to the Estimation of Distributions I. Binary Parameters. In: Voigt, H.-M., Ebeling, W., Rechenberg, I., Schwefel, H.-P. (eds.) Parallel Problem Solving from Nature, PPSN-IV, pp. 178\u2013187 (1996)","DOI":"10.1007\/3-540-61723-X_982"},{"key":"6_CR5","unstructured":"Baluja, S., Davies, S.: Using Optimal Dependency Trees for Combinatorial Optimization: Learning the Structure of the Search Space. Technical Report CMU-CS-97-107, Carnegie Mellon University (1997)"},{"key":"6_CR6","first-page":"343","volume-title":"Proceedings of Uncertainty in Artificial Intelligence, UAI-2000","author":"P. Larra\u00f1aga","year":"2000","unstructured":"Larra\u00f1aga, P., Etxeberria, R., Lozano, J.A., Pe\u00f1a, J.M.: Combinatorial Optimization by Learning and Simulation of Bayesian Networks. In: Boutilier, C., Goldszmidt, M. (eds.) Proceedings of Uncertainty in Artificial Intelligence, UAI-2000, pp. 343\u2013352. Morgan Kaufmann, San Francisco (2000)"},{"key":"6_CR7","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/3-540-58484-6_259","volume-title":"Parallel Problem Solving from Nature, PPSN III","author":"J. Horn","year":"1994","unstructured":"Horn, J., Goldberg, D.E., Deb, K.: Long Path Problems. In: Davidor, Y., Schwefel, H.-P., M\u00e4nner, R. (eds.) Parallel Problem Solving from Nature, PPSN III, pp. 149\u2013158. Springer, Heidelberg (1994)"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0004-3702(01)00058-3","volume":"127","author":"J. He","year":"2001","unstructured":"He, J., Yao, X.: Drift Analysis and Average Time Complexity of Evolutionary Algorithms. Artificial Intelligence\u00a0127, 57\u201385 (2001)","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Computational Intelligence and Bioinspired Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11494669_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:59:36Z","timestamp":1605643176000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11494669_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262084","9783540321064"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11494669_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}