{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:44Z","timestamp":1725664184816},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584841"},{"type":"electronic","value":"9783540490012"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58484-6_274","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:25:24Z","timestamp":1330255524000},"page":"302-311","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Genetic Programming with local hill-climbing"],"prefix":"10.1007","author":[{"given":"Hitoshi","family":"Iba","sequence":"first","affiliation":[]},{"given":"Hugo","family":"de Garis","sequence":"additional","affiliation":[]},{"given":"Taisuke","family":"Sato","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Armstrong, W.W. and Gecsei, J. Adaptation Algorithms for Binary Tree Networks, IEEE TR. SMC, SMC-9, No.5, 1979","DOI":"10.1109\/TSMC.1979.4310196"},{"key":"30_CR2","unstructured":"Armstrong, W.W. Learning and Generalization in Adaptive Logic Networks, Artificial Neural Networks, (T.Kohonen eds.), Elsevier Science Pub., 1991"},{"key":"30_CR3","unstructured":"Armstrong, W.W., Dwelly, A., Liang, J., Lin,D., and Reynolds,S., Some Results concerning Adaptive Logic Networks, unpublished manuscript, Sept. 16, 1991"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Barzdins, J.M., and Barzdins, G.J., Rapid Construction of Algebraic Axioms from Samples, Theoretical Computer Science, vol.90, 1991","DOI":"10.1007\/BFb0019352"},{"key":"30_CR5","unstructured":"Holland,J.H. Adaptation in natural and artificial systems, University of Michigan Press, 1975"},{"key":"30_CR6","unstructured":"Iba, H., Kurita, T., deGaris, H. and Sato, T. System Identification using Structured Genetic Algorithms, in Proc. of 5th International Joint Conference on Genetic Algorithms, 1993"},{"key":"30_CR7","unstructured":"Iba, H., Niwa, T., deGaris, H. and Sato, T. Evolutionary Learning of Boolean Concepts: An Empirical Study, ETL-TR-93-25, 1993"},{"key":"30_CR8","unstructured":"Iba, H., deGaris, H. and Sato, T. System Identification Approach to Genetic Programming, ETL-TR94-2, in Proc. of IEEE World Congress on Computational Intelligence(WCCI94), 1994"},{"key":"30_CR9","unstructured":"Iba, H., deGaris, H. and Sato, T. Genetic Programming using a Minimum Description Length Principle, in Advances in Genetic Programming, (ed. Kenneth E. Kinnear, Jr.), MIT Press, 1994"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Ivakhnenko, A. G. Polynomial Theory of Complex Systems, IEEE Tr. SMC, vol.SMC-1, no.4, 1971","DOI":"10.1109\/TSMC.1971.4308320"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Janikow, C.Z., A Knowledge-Intensive Genetic Algorithm for Supervised Learning, Machine Learning, vol.13, 1993","DOI":"10.1007\/978-1-4615-2740-4_3"},{"key":"30_CR12","unstructured":"Koza, J. Genetic programming: A paradigm for genetically breeding populations of computer programs to solve problems, Report No. STAN-CS-90-1314, Dept. of Computer Science, Stanford Univ., 1990"},{"key":"30_CR13","unstructured":"Koza, J. Genetic Programming, On the Programming of Computers by means of Natural Selection, MIT Press, 1992"},{"key":"30_CR14","unstructured":"Koza, J. Genetic Programming II: Automatic Discovery of Reusable Subprograms, MIT Press, 1994 (in press)"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Langley, P., and Zytkow, J. M., Data-driven Approaches to Empirical Discovery, Artificial Intelligence, vol.40, 1989","DOI":"10.21236\/ADA201850"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Louis, S.J. and Rawlins, G.J.E., Pareto Optimality, GA-easiness and Deception, In Proc. of 5th International Joint Conference on Genetic Algorithms (ICGA93), 1993","DOI":"10.1016\/B978-0-08-094832-4.50015-5"},{"key":"30_CR17","unstructured":"Schaffer, J.D. and Eshelman, L.J., On Crossover as an Evolutionarily Viable Strategy, In Proc. of 4th International Joint Conference on Genetic Algorithms (ICGA91), 1991"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2014 PPSN III"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58484-6_274","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T02:46:38Z","timestamp":1640918798000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58484-6_274"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584841","9783540490012"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-58484-6_274","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"8 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}