{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:35Z","timestamp":1725665015434},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540631736"},{"type":"electronic","value":"9783540692041"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63173-9_57","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:17:20Z","timestamp":1330298240000},"page":"327-343","source":"Crossref","is-referenced-by-count":16,"title":["Machine learning approach to gate-level Evolvable Hardware"],"prefix":"10.1007","author":[{"given":"Hitoshi","family":"Iba","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masaya","family":"Iwata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tetsuya","family":"Higuchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"24_CR1","unstructured":"Akaike, H., On the Entropy Maximization Principle, in Applications of Statistics, Krishnaiah, P.R. (ed.), North-Holland, 1977"},{"key":"24_CR2","unstructured":"Anthony, M. and Biggs, N., Computational Learning Theory, Cambridge Tracts in Theoretical Computer Science 30, Cambridge, 1992"},{"key":"24_CR3","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"},{"issue":"no.4","key":"24_CR4","doi-asserted-by":"crossref","first-page":"1034","DOI":"10.1109\/18.86996","volume":"37","author":"A.R. Barron","year":"1991","unstructured":"Barron, A.R. Minimum Complexity Density Estimation, in IEEE Tr. on Information Theory, vol. 37, no. 4, pp. 1034\u20131054, 1991","journal-title":"IEEE Tr. on Information Theory"},{"key":"24_CR5","unstructured":"Goldberg, D. et al., Rapid Accurate Optimization of Difficult Problems using Fast Messy Genetic Algorithms, Proc. 5th Int. Joint Conf. on Genetic Algorithms (ICGA93), 1993"},{"key":"24_CR6","unstructured":"Higuchi, T. et al., Evolvable Hardware with Genetic Learning, in Massively Parallel Artificial Intelligence (eds. H. Kitano), MIT Press, pp 398\u2013421, 1994."},{"key":"24_CR7","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, pp. 265\u2013284, 1994"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Iba, H., deGaris, H. and Sato, T., Numerical Approach to Genetic Programming for System Identification, in Evolutionary Computation, vol. 3, no. 4, 1996","DOI":"10.1162\/evco.1995.3.4.417"},{"key":"24_CR9","volume-title":"A Pattern Recognition System Using Evolvable Hardware","author":"M. Iwata","year":"1996","unstructured":"Iwata, M., Kajitani, I., Yamada, H., Iba, H. and Higuchi, T., A Pattern Recognition System Using Evolvable Hardware, in Proc. of Parallel Problem Solving from Nature IV (Berlin, Germany: Springer-Verlag), 1996"},{"key":"24_CR10","unstructured":"Kajitani, I. et al., Variable Length Chromosome GA for Evolvable Hardware in Proc. of 3rd Int. Conf. on Evolutionary Computation (ICEC96), 1996."},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Konagaya, A. and Kondo, H., Stochastic Motif Extraction using a Genetic Algorithm with the MDL Principle, in Hawaii Int. Conf. of Computer Systems, 1993","DOI":"10.1109\/HICSS.1993.270666"},{"key":"24_CR12","volume-title":"Hardware Evolution at Function Levels","author":"M. Murakawa","year":"1996","unstructured":"Murakawa, M., Yoshizawa, S., Kajitani, I., Furuya, T., Iwata, M. and Higuchi, T., Hardware Evolution at Function Levels, Proc. of Parallel Problem Solving from Nature IV (Berlin, Germany: Springer-Verlag), 1996"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Pagallo, G. and Hausslear, D. Boolean Feature Discovery in Empirical Learning, Machine Learning, vol. 5, 1990","DOI":"10.1007\/BF00115895"},{"key":"24_CR14","unstructured":"Rissanen, J., Stochastic Complexity in Statistical Inquiry, World Scientific, 1989"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Rumelhart, D.E. and McClelland, J.L. Parallel Distributed Processing, MIT Press, 1986","DOI":"10.7551\/mitpress\/5236.001.0001"},{"key":"24_CR16","unstructured":"Seshu, R., Binary Decision Trees and an \u201cAverage-case\u201d Model for Concept Learning: Implications for Feature Construction and the Study of Bias, in Computational Learning Theory and Natural Learning Systems, Volume I: Constraints and Prospects, Hanson, J. et al. (eds.), MIT Press, pp. 213\u2013248, 1994"},{"issue":"no.1","key":"24_CR17","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/72.80209","volume":"1","author":"M.F. Tenorio","year":"1990","unstructured":"Tenorio, M.F. and Lee, W. Self-organizing Network for Optimum Supervised Learning, IEEE Tr. Neural Networks, vol. 1, no. 1, pp. 100\u2013109, 1990","journal-title":"IEEE Tr. Neural Networks"},{"issue":"no.3","key":"24_CR18","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1111\/j.2517-6161.1987.tb01695.x","volume":"49","author":"C.S. Wallace","year":"1987","unstructured":"Wallace, C.S. and Freeman, P.R. Estimation and Inference by Compact Coding, in Journal of Royal Statistical Society, Ser.B, vol. 49, no. 3, pp. 240\u2013265, 1987","journal-title":"Journal of Royal Statistical Society, Ser.B"},{"key":"24_CR19","unstructured":"Weigend, A.S. and Rumelhart, D.E., Weight Elimination and Effective Network Size, in Computational Learning Theory and Natural Learning Systems, Volume I: Constraints and Prospects, Hanson, J. et al. (eds.), MIT Press, pp. 457\u2013476, 1994"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Wilson, S.W., Classifier Systems and the Animat Problem, Machine Learning, vol. 2, no. 3, 1987","DOI":"10.1007\/BF00058679"},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Yamanishi, K., and Konagaya, A., \u201cLearning Stochastic Motifs from Genetic Sequences\u201d, in Proc. of 8th International Workshop on Machine Learning, pp. 467\u2013471, 1991","DOI":"10.1016\/B978-1-55860-200-7.50096-9"},{"key":"24_CR22","first-page":"165","volume":"9","author":"K. Yamanishi","year":"1992","unstructured":"Yamanishi, K., A Learning Criterion for Stochastic Rules, in Machine Learning, vol. 9, pp. 165\u2013204, 1992","journal-title":"Machine Learning"},{"issue":"no.1","key":"24_CR23","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1162\/evco.1995.3.1.17","volume":"3","author":"B.-T. Zhang","year":"1995","unstructured":"Zhang, B.-T. and M\u00fchlenbein, H., Balancing Accuracy and Parsimony in Genetic Programming, in Evolutionary Computation, vol. 3, no. 1, pp. 17\u201338, 1995","journal-title":"Evolutionary Computation"}],"container-title":["Lecture Notes in Computer Science","Evolvable Systems: From Biology to Hardware"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63173-9_57.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T18:09:47Z","timestamp":1713636587000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63173-9_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631736","9783540692041"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-63173-9_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}