{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:54:39Z","timestamp":1725566079584},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223443"},{"type":"electronic","value":"9783540248545"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24854-5_77","type":"book-chapter","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T14:40:42Z","timestamp":1284475242000},"page":"761-773","source":"Crossref","is-referenced-by-count":9,"title":["An Analysis of the (\u03bc+1)\u00a0EA on Simple Pseudo-Boolean Functions"],"prefix":"10.1007","author":[{"given":"Carsten","family":"Witt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"77_CR1","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","volume":"276","author":"S. Droste","year":"2002","unstructured":"Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science\u00a0276, 51\u201381 (2002)","journal-title":"Theoretical Computer Science"},{"key":"77_CR2","first-page":"253","volume-title":"Proc. of Foundations of Genetic Algorithms 7 (FOGA 2002)","author":"S. Droste","year":"2003","unstructured":"Droste, S., Jansen, T., Tinnefeld, K., Wegener, I.: A new framework for the valuation of algorithms for black-box optimization. In: Proc. of Foundations of Genetic Algorithms 7 (FOGA 2002), pp. 253\u2013270. Morgan Kaufmann, San Francisco (2003)"},{"key":"77_CR3","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/evco.1999.7.2.173","volume":"7","author":"J. Garnier","year":"1999","unstructured":"Garnier, J., Kallel, L., Schoenauer, M.: Rigorous hitting times for binary mutations. Evolutionary Computation\u00a07, 173\u2013203 (1999)","journal-title":"Evolutionary Computation"},{"key":"77_CR4","doi-asserted-by":"publisher","first-page":"1918","DOI":"10.1109\/CEC.2003.1299908","volume-title":"Proc. of the 2003 Congress on Evol. Computation","author":"O. Giel","year":"2003","unstructured":"Giel, O.: Expected runtimes of a simple multi-objective evolutionary algorithm. In: Proc. of the 2003 Congress on Evol. Computation, pp. 1918\u20131925. IEEE Press, Los Alamitos (2003)"},{"key":"77_CR5","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1109\/TEVC.2002.800886","volume":"6","author":"J. He","year":"2002","unstructured":"He, J., Yao, X.: From an individual to a population: An analysis of the first hitting time of population-based evolutionary algorithms. IEEE Transactions on Evolutionary Computation\u00a06, 495\u2013511 (2002)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"77_CR6","unstructured":"Jansen, T., De Jong, K.: An analysis of the role of offspring population size in EAs. In: Proc. of GECCO 2002, pp. 238\u2013246 (2002)"},{"key":"77_CR7","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1109\/4235.974841","volume":"5","author":"T. Jansen","year":"2001","unstructured":"Jansen, T., Wegener, I.: Evolutionary algorithms \u2013 how to cope with plateaus of constant fitness and when to reject strings of the same fitness. IEEE Transactions on Evolutionary Computation\u00a05, 589\u2013599 (2001a)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"77_CR8","unstructured":"Jansen, T., Wegener, I.: On the utility of populations. In: Proc. of GECCO 2001, pp. 1034\u20131041 (2001b)"},{"key":"77_CR9","unstructured":"Jansen, T., Wegener, I.: Real royal road functions \u2013 where crossover provably is essential. In: Proc. of GECCO 2001, pp. 375\u2013382 (2001c)"},{"key":"77_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambr. Univ. Press, Cambridge (1995)"},{"key":"77_CR11","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1002\/rsa.3240050207","volume":"5","author":"B. Pittel","year":"1994","unstructured":"Pittel, B.: Note on the heights of random recursive trees and random m-ary search trees. Random Structures and Algorithms\u00a05, 337\u2013348 (1994)","journal-title":"Random Structures and Algorithms"},{"key":"77_CR12","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/(SICI)1098-2418(199807)12:4<313::AID-RSA1>3.0.CO;2-W","volume":"12","author":"Y. Rabani","year":"1998","unstructured":"Rabani, Y., Rabinovich, Y., Sinclair, A.: A computational view of population genetics. Random Structures and Algorithms\u00a012, 313\u2013334 (1998)","journal-title":"Random Structures and Algorithms"},{"key":"77_CR13","first-page":"1","volume":"51","author":"R.T. Smythe","year":"1995","unstructured":"Smythe, R.T., Mahmoud, H.M.: A survey of recursive trees. Theory of Probability and Mathematical Statistics\u00a051, 1\u201327 (1995)","journal-title":"Theory of Probability and Mathematical Statistics"},{"key":"77_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1406","DOI":"10.1007\/3-540-45110-2_14","volume-title":"Genetic and Evolutionary Computation - GECCO 2003","author":"T. Storch","year":"2003","unstructured":"Storch, T., Wegener, I.: Real royal road functions for constant population size. In: Cant\u00fa-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O\u2019Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol.\u00a02723, pp. 1406\u20131417. Springer, Heidelberg (2003)"},{"key":"77_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1007\/3-540-45105-6_73","volume-title":"Genetic and Evolutionary Computation - GECCO 2003","author":"I. Wegener","year":"2003","unstructured":"Wegener, I., Witt, C.: On the optimization of monotone polynomials by the (1+1) EA and randomized local search. In: Cant\u00fa-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O\u2019Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol.\u00a02723, pp. 622\u2013633. Springer, Heidelberg (2003)"},{"key":"77_CR16","doi-asserted-by":"publisher","first-page":"1996","DOI":"10.1109\/CEC.2003.1299918","volume-title":"Proc. of the 2003 Congress on Evol. Computation","author":"C. Witt","year":"2003","unstructured":"Witt, C.: Population size vs. runtime of a simple EA. In: Proc. of the 2003 Congress on Evol. Computation, vol.\u00a03, pp. 1996\u20132003. IEEE Press, Los Alamitos (2003)"}],"container-title":["Lecture Notes in Computer Science","Genetic and Evolutionary Computation \u2013 GECCO 2004"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24854-5_77","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T18:20:50Z","timestamp":1558290050000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24854-5_77"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223443","9783540248545"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24854-5_77","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}