{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:20:34Z","timestamp":1725495634459},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540418993"},{"type":"electronic","value":"9783540453550"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":[[2001]]},"DOI":"10.1007\/3-540-45355-5_1","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T18:12:32Z","timestamp":1194977552000},"page":"1-10","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Heuristic Learning Based on Genetic Programming"],"prefix":"10.1007","author":[{"given":"Nicole","family":"Drechsler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Schmiedle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Gro\u00dfe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Drechsler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,4,2]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"8","author":"R.E. Bryant","year":"1986","unstructured":"R.E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Comp., 8:677\u2013691, 1986.","journal-title":"IEEE Trans. on Comp."},{"issue":"num. 9","key":"1_CR2","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1109\/12.537122","volume":"45","author":"B. Bollig","year":"1996","unstructured":"B. Bollig and I. Wegener. Improving the variable ordering of OBDDs is NP-complete. IEEE Trans. on Comp., vol. 45,num. 9, pages 993\u20131002, 1996.","journal-title":"IEEE Trans. on Comp."},{"key":"1_CR3","unstructured":"B. Bollig, M. L\u00f6bbing, and I. Wegener. Simulated annealing to improve variable orderings for OBDDs. In Int\u2019l Workshop on Logic Synth., pages 5b:5.1\u20135.10, 1995."},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"R. Drechsler and B. Becker. Learning heuristics by genetic algorithms. In ASP Design Automation Conf., pages 349\u2013352, 1995.","DOI":"10.1145\/224818.224920"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"R. Drechsler and B. Becker. Binary Decision Diagrams\u2014Theory and Implementation, Kluwer Academic Publishers, 1998","DOI":"10.1007\/978-1-4757-2892-7"},{"key":"1_CR6","unstructured":"R. Drechsler, B. Becker, and N. G\u00f6ckel. A genetic algorithm for variable ordering of OBDDs. In Int\u2019l Workshop on Logic Synth., pages P5c:5.55\u20135.64, 1995."},{"key":"1_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/3-540-48774-3_14","volume-title":"Fuzzy\u201999","author":"N. Drechsler","year":"1999","unstructured":"N. Drechsler, R. Drechsler, and B. Becker. A new model for multi-objective optimization in evolutionary algorithms. In Fuzzy\u201999, LNCS 1625, pages 108\u2013117, 1999."},{"key":"1_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1007\/3-540-61723-X_1036","volume-title":"PPSN\u201996","author":"R. Drechsler","year":"1996","unstructured":"R. Drechsler, N. G\u00f6ckel, and B. Becker. Learning heuristics for OBDD minimization by evolutionary algorithms. In PPSN\u201996, LNCS 1141, pages 730\u2013739, 1996."},{"key":"1_CR9","unstructured":"M. Fujita, Y. Matsunga, and T. Kakuda. On variable ordering of binary decision diagrams for the application of multi-level synthesis. In European Conf. on Design Automation, pages 50\u201354, 1991."},{"key":"1_CR10","unstructured":"J. Koza. Genetic Programming-On the Programming of Computers by means of Natural Selection. MIT Press, 1992"},{"key":"1_CR11","unstructured":"J. Koza. Genetic Programming II-Automatic Discovery of Reusable Programs. MIT Press, 1994"},{"key":"1_CR12","unstructured":"S. Panda and F. Somenzi. Who are the variables in your neighborhood. In Int\u2019l Conf. on CAD, pages 74\u201377, 1995."},{"key":"1_CR13","unstructured":"D.E. Ross, K.M. Butler, R. Kapur, and M.R. Mercer. Functional approaches to generating orderings for efficient symbolic representations. In Design Automation Conf., pages 624\u2013627, 1992."},{"key":"1_CR14","unstructured":"R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In Int\u2019l Conf. on CAD, pages 42\u201347, 1993."}],"container-title":["Lecture Notes in Computer Science","Genetic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45355-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T10:54:46Z","timestamp":1558263286000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45355-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540418993","9783540453550"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45355-5_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"2 April 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}