{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:40:36Z","timestamp":1750308036620,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,7,8]],"date-time":"2006-07-08T00:00:00Z","timestamp":1152316800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,7,8]]},"DOI":"10.1145\/1143997.1144150","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"879-886","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Convergence to global optima for genetic programming systems with dynamically scaled operators"],"prefix":"10.1145","author":[{"given":"Lothar M.","family":"Schmitt","sequence":"first","affiliation":[{"name":"The University of Aizu, Aizu-Wakamatsu City, Japan"}]},{"given":"Stefan","family":"Droste","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Dortmund, Dortmund, Germany"}]}],"member":"320","published-online":{"date-parts":[[2006,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9574.1989.tb01245.x"},{"key":"e_1_3_2_1_2_1","first-page":"9","volume-title":"Subtree crossover: Building block engine or macromutation","author":"Angeline P.","year":"1997","unstructured":"P. Angeline . Subtree crossover: Building block engine or macromutation . In J. R. Koza, et al, editors, Genetic Programming 97, pages 9 -- 17 . Morgan Kaufmann , San Francisco, CA, USA, 1997 .]] P. Angeline. Subtree crossover: Building block engine or macromutation. In J. R. Koza, et al, editors, Genetic Programming 97, pages 9--17. Morgan Kaufmann, San Francisco, CA, USA, 1997.]]"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/548530"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/280485"},{"key":"e_1_3_2_1_5_1","first-page":"54","volume-title":"J. R. Koza et al","author":"Droste S.","year":"1998","unstructured":"S. Droste . Genetic programming with guaranteed quality . In J. R. Koza et al , editors, Genetic Programming 98, pages 54 -- 59 . Morgan Kaufmann , San Francisco, CA, USA, 1998 .]] S. Droste. Genetic programming with guaranteed quality. In J. R. Koza et al, editors, Genetic Programming 98, pages 54--59. Morgan Kaufmann, San Francisco, CA, USA, 1998.]]"},{"key":"e_1_3_2_1_6_1","volume-title":"Evolutionary Computation: Toward a New Philosophy of Machine Intelligence","author":"Fogel D. B.","year":"1995","unstructured":"D. B. Fogel . Evolutionary Computation: Toward a New Philosophy of Machine Intelligence . IEEE Press , Piscataway, NY, USA , 1995 .]] D. B. Fogel. Evolutionary Computation: Toward a New Philosophy of Machine Intelligence. IEEE Press, Piscataway, NY, USA, 1995.]]"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/129194"},{"key":"e_1_3_2_1_8_1","volume-title":"Markov Chains: Theory and Applications","author":"Isaacson D. L.","year":"1961","unstructured":"D. L. Isaacson and R. W. Madsen . Markov Chains: Theory and Applications . Prentice-Hall , Upper Saddle River, NJ, USA, 1961 .]] D. L. Isaacson and R. W. Madsen. Markov Chains: Theory and Applications. Prentice-Hall, Upper Saddle River, NJ, USA, 1961.]]"},{"key":"e_1_3_2_1_9_1","unstructured":"J. R. Koza. Genetic Programming. MIT Press Cambridge MA USA 1992.]]   J. R. Koza. Genetic Programming. MIT Press Cambridge MA USA 1992.]]"},{"key":"e_1_3_2_1_10_1","volume-title":"Analysis I","author":"Lang S.","year":"1969","unstructured":"S. Lang . Analysis I . Addison-Wesley , Boston, MA, USA , 1969 .]] S. Lang. Analysis I. Addison-Wesley, Boston, MA, USA, 1969.]]"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/506376"},{"key":"e_1_3_2_1_12_1","first-page":"829","volume-title":"Genetic and Evolutionary Computation Conference","author":"Luke S.","year":"2002","unstructured":"S. Luke and L. Panait . Lexicographic parsimony pressure. In W. B. Langdon, et al, editors , Genetic and Evolutionary Computation Conference , pages 829 -- 836 . Morgan Kaufmann, San Francisco, CA, USA , 2002 .]] S. Luke and L. Panait. Lexicographic parsimony pressure. In W. B. Langdon, et al, editors, Genetic and Evolutionary Computation Conference, pages 829--836. Morgan Kaufmann, San Francisco, CA, USA, 2002.]]"},{"key":"e_1_3_2_1_13_1","first-page":"208","volume-title":"J. R. KozaetAl","author":"Luke S.","year":"1998","unstructured":"S. Luke and L. Spector . A revised comparison of crossover and mutation in genetic programming . In J. R. KozaetAl , editors, Genetic Programming 98, pages 208 -- 213 . Morgan Kaufmann , San Francisco, CA, USA, 1998 .]] S. Luke and L. Spector. A revised comparison of crossover and mutation in genetic programming. In J. R. KozaetAl, editors, Genetic Programming 98, pages 208--213. Morgan Kaufmann, San Francisco, CA, USA, 1998.]]"},{"key":"e_1_3_2_1_14_1","first-page":"143","volume-title":"Foundations of Genetic Algorithms 6","author":"Poli R.","year":"2000","unstructured":"R. Poli . Recursive conditional schema theorem , convergence and population sizing in genetic algorithms . In W. N. Martin and W. M. Spears, editors, Foundations of Genetic Algorithms 6 , pages 143 -- 163 . Morgan Kaufmann , San Francisco, CA, USA , 2000 .]] R. Poli. Recursive conditional schema theorem, convergence and population sizing in genetic algorithms. In W. N. Martin and W. M. Spears, editors, Foundations of Genetic Algorithms 6, pages 143--163. Morgan Kaufmann, San Francisco, CA, USA, 2000.]]"},{"key":"e_1_3_2_1_15_1","first-page":"535","volume-title":"Genetic and Evolutionary Computation Conference","author":"Rowe J. E.","year":"2001","unstructured":"J. E. Rowe and N. F. McPhee . The effects of crossover and mutation operators on variable length linear structures. In L. Spector, et al, editors , Genetic and Evolutionary Computation Conference , pages 535 -- 542 . Morgan Kaufmann, San Francisco, CA, USA , 2001 .]] J. E. Rowe and N. F. McPhee. The effects of crossover and mutation operators on variable length linear structures. In L. Spector, et al, editors, Genetic and Evolutionary Computation Conference, pages 535--542. Morgan Kaufmann, San Francisco, CA, USA, 2001.]]"},{"key":"e_1_3_2_1_16_1","volume-title":"Functional Analysis","author":"Rudin W.","year":"1973","unstructured":"W. Rudin . Functional Analysis . McGraw-Hill , New York, NY, USA , 1973 .]] W. Rudin. Functional Analysis. McGraw-Hill, New York, NY, USA, 1973.]]"},{"key":"e_1_3_2_1_17_1","volume-title":"Topological Vector Spaces","author":"Schaefer H. H.","year":"1970","unstructured":"H. H. Schaefer . Topological Vector Spaces . Springer , Berlin, Germany , 1970 .]] H. H. Schaefer. Topological Vector Spaces. Springer, Berlin, Germany, 1970.]]"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00406-0"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/1-4020-7782-3_8"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00393-1"},{"key":"e_1_3_2_1_21_1","first-page":"138","volume-title":"Genetic and Evolutionary Computation Conference","author":"Schmitt L. M.","year":"2004","unstructured":"L. M. Schmitt . Classification with scaled genetic algorithms in a coevolutionary setting. In R. PolietAl, editors , Genetic and Evolutionary Computation Conference , pages 138 -- 149 . Springer, Berlin, Germany , 2004 . LNCS 3103.]] L. M. Schmitt. Classification with scaled genetic algorithms in a coevolutionary setting. In R. PolietAl, editors, Genetic and Evolutionary Computation Conference, pages 138--149. Springer, Berlin, Germany, 2004. LNCS 3103.]]"},{"key":"e_1_3_2_1_22_1","volume-title":"Evolution and Optimum Seeking","author":"Schwefel H.-P.","year":"1995","unstructured":"H.-P. Schwefel . Evolution and Optimum Seeking . John Wiley & Sons , New York, NY, USA , 1995 .]] H.-P. Schwefel. Evolution and Optimum Seeking. John Wiley & Sons, New York, NY, USA, 1995.]]"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585893"}],"event":{"name":"GECCO06: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Seattle Washington USA","acronym":"GECCO06"},"container-title":["Proceedings of the 8th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1143997.1144150","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1143997.1144150","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:14:15Z","timestamp":1750259655000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1143997.1144150"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,8]]},"references-count":23,"alternative-id":["10.1145\/1143997.1144150","10.1145\/1143997"],"URL":"https:\/\/doi.org\/10.1145\/1143997.1144150","relation":{},"subject":[],"published":{"date-parts":[[2006,7,8]]},"assertion":[{"value":"2006-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}