{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:04Z","timestamp":1725558964274},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540239314"},{"type":"electronic","value":"9783540304999"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30499-9_36","type":"book-chapter","created":{"date-parts":[[2010,6,30]],"date-time":"2010-06-30T13:41:13Z","timestamp":1277905273000},"page":"242-247","source":"Crossref","is-referenced-by-count":0,"title":["Gray and Binary Encoding in the (1+1)-EA"],"prefix":"10.1007","author":[{"given":"Uday K.","family":"Chakraborty","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0020-0255(03)00178-6","volume":"156","author":"U.K. Chakraborty","year":"2003","unstructured":"Chakraborty, U.K., Janikow, C.Z.: An analysis of Gray versus binary encoding in genetic search. Information Sciences\u00a0156, 253\u2013269 (2003)","journal-title":"Information Sciences"},{"key":"36_CR2","unstructured":"Droste, S.: Analysis of the (1+1) EA for a dynamically changing objective function, Tech. Report No. C1-113\/01, Univ. of Dortmund (2001)"},{"issue":"5","key":"36_CR3","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 Trans. Evol. Comput.\u00a06(5), 495\u2013511 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"36_CR4","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 ofmonotone 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)"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30499-9_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:24:25Z","timestamp":1620012265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30499-9_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540239314","9783540304999"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30499-9_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}