{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T11:15:18Z","timestamp":1772104518209,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540617235","type":"print"},{"value":"9783540706687","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61723-x_1036","type":"book-chapter","created":{"date-parts":[[2006,7,12]],"date-time":"2006-07-12T10:34:58Z","timestamp":1152700498000},"page":"730-739","source":"Crossref","is-referenced-by-count":16,"title":["Learning heuristics for OBDD minimization by Evolutionary Algorithms"],"prefix":"10.1007","author":[{"given":"Rolf","family":"Drechsler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicole","family":"G\u00f6ckel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernd","family":"Becker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,11]]},"reference":[{"key":"73_CR1","doi-asserted-by":"crossref","unstructured":"P. Ashar, S. Devadas, and K. Keutzer. Gate-delay-fault testability properties of multiplexor-based networks. In Int'l Test Conf., pages 887\u2013896, 1991.","DOI":"10.1109\/TEST.1991.519755"},{"issue":"1","key":"73_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-9260(93)90002-T","volume":"15","author":"P. Ashar","year":"1993","unstructured":"P. Ashar, S. Devadas, and K. Keutzer. Path-delay-fault testability properties of multiplexor-based networks. Integration the VLSI Jour., 15(1):1\u201323, 1993.","journal-title":"Integration the VLSI Jour."},{"issue":"1","key":"73_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/evco.1993.1.1.1","volume":"1","author":"T. B\u00e4ck","year":"1993","unstructured":"T. B\u00e4ck and H. Schwefel. An overview of evolutionary algorithms for parameter optimization. Evolutionary Computation, 1(1):1\u201323, 1993.","journal-title":"Evolutionary Computation"},{"key":"73_CR4","unstructured":"B. Bollig, M. L\u00f6bbing, and I. Wegener. Simulated annealing to improve variable orderings for OBDDs. In Int'l Workshop on Logic Synth., pages 5b:5.1\u20135.10, 1995."},{"key":"73_CR5","unstructured":"B. Bollig, P. Savicky, and I. Wegener. On the improvement of variable orderings for OBDDs. IFIP Workshop on Logic and Architecture Synthesis, Grenoble, pages 71\u201380, 1994."},{"key":"73_CR6","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"8","author":"R.E. Bryant","year":"1986","unstructured":"R.E. Bryant. Graph \u2014 based algorithms for Boolean function manipulation. IEEE Trans. on Comp., 8:677\u2013691, 1986.","journal-title":"IEEE Trans. on Comp."},{"key":"73_CR7","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"R.E. Bryant","year":"1992","unstructured":"R.E. Bryant. Symbolic boolean manipulation with ordered binary decision diagrams. ACM, Comp. Surveys, 24:293\u2013318, 1992.","journal-title":"ACM, Comp. Surveys"},{"key":"73_CR8","volume-title":"Handbook of Genetic Algorithms","author":"L. Davis","year":"1991","unstructured":"L. Davis. Handbook of Genetic Algorithms. van Nostrand Reinhold, New York, 1991."},{"key":"73_CR9","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":"73_CR10","doi-asserted-by":"crossref","unstructured":"R. Drechsler, B. Becker, and N. G\u00f6ckel. A genetic algorithm for minimization of Fixed Polarity Reed-Muller expressions. In Int'l Conf. on Artificial Neural Networks and Genetic Algorithms, pages 392\u2013395, 1995.","DOI":"10.1007\/978-3-7091-7535-4_102"},{"key":"73_CR11","unstructured":"R. Drechsler, B. Becker, and N. G\u00f6ckel. A genetic algorithm for variable ordering of OBDDs. In Int'l Workshop on Logic Synth., pages P5c:5.55\u20135.64, 1995."},{"key":"73_CR12","unstructured":"H. Esbensen. A macro-cell global router based on two genetic algorithms. In European Design Automation Conf., pages 428\u2013433, 1994."},{"key":"73_CR13","doi-asserted-by":"crossref","unstructured":"S.J. Friedman and K.J. Supowit. Finding the optimal variable ordering for binary decision diagrams. In Design Automation Conf., pages 348\u2013356, 1987.","DOI":"10.1145\/37888.37941"},{"key":"73_CR14","doi-asserted-by":"crossref","unstructured":"H. Fujii, G. Ootomo, and C. Hori. Interleaving based variable ordering methods for ordered binary decision diagrams. In Int'l Conf. on CAD, pages 38\u201341, 1993.","DOI":"10.1109\/ICCAD.1993.580028"},{"key":"73_CR15","doi-asserted-by":"crossref","unstructured":"M. Fujita, H. Fujisawa, and N. Kawato. Evaluation and improvements of boolean comparison method based on binary decision diagrams. In Int'l Conf. on CAD, pages 2\u20135, 1988.","DOI":"10.1109\/ICCAD.1988.122450"},{"key":"73_CR16","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/43.184839","volume":"12","author":"M. Fujita","year":"1993","unstructured":"M. Fujita, H. Fujisawa, and Y. Matsunaga. Variable ordering algorithms for binary decision diagrams and their evolution. IEEE Trans. on CAD, 12:6\u201312, 1993.","journal-title":"IEEE Trans. on CAD"},{"key":"73_CR17","doi-asserted-by":"crossref","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.","DOI":"10.1109\/EDAC.1991.206358"},{"key":"73_CR18","unstructured":"D.E. Goldberg. Genetic Algortithms in Search, Optimization & Machine Learning. Addision-Wesley Publisher Company, Inc., 1989."},{"key":"73_CR19","doi-asserted-by":"crossref","unstructured":"N. Ishiura, H. Sawada, and S. Yajima. Minimization of binary decision diagrams based on exchange of variables. In Int'l Conf. on CAD, pages 472\u2013475, 1991.","DOI":"10.1109\/ICCAD.1991.185307"},{"key":"73_CR20","doi-asserted-by":"crossref","unstructured":"A. Kuehlmann and L.P.P.P. van Ginneken. Grammar-based optimization of synthesis scenarios. In Int'l Conf. on Comp. Design, pages 20\u201325, 1994.","DOI":"10.1109\/ICCD.1994.331846"},{"key":"73_CR21","doi-asserted-by":"crossref","unstructured":"L. Lavagno, P. McGeer, A. Saldanha, and A.L. Sangiovanni-Vincentelli. Timed shannon circuits: A power-efficient design style and synthesis tool. In Design Automation Conf., pages 254\u2013260, 1995.","DOI":"10.1109\/DAC.1995.250100"},{"key":"73_CR22","unstructured":"V.V. Le, T. Besson, A. Abbara, D. Brasen, H. Bogushevitsh, G. Saucier, and M. Crastes. ASIC prototyping with area oriented mapping for ALTERA\/FLEX devices. In SASIMI, pages 176\u2013183, 1995."},{"issue":"4","key":"73_CR23","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1162\/evco.1993.1.4.293","volume":"1","author":"J. Lienig","year":"1993","unstructured":"J. Lienig and K. Thulasiraman. A genetic algorithm for channel routing in VLSI circuits. Evolutionary Computation, 1(4):293\u2013311, 1993.","journal-title":"Evolutionary Computation"},{"key":"73_CR24","doi-asserted-by":"crossref","unstructured":"S. Malik, A.R. Wang, R.K. Brayton, and A.L. Sangiovanni-Vincentelli. Logic verification using binary decision diagrams in a logic synthesis environment. In Int'l Conf. on CAD, pages 6\u20139, 1988.","DOI":"10.1109\/ICCAD.1988.122451"},{"key":"73_CR25","doi-asserted-by":"crossref","unstructured":"S. Minato, N. Ishiura, and S. Yajima. Shared binary decision diagrams with attributed edges for efficient boolean function manipulation. In Design Automation Conf., pages 52\u201357, 1990.","DOI":"10.1145\/123186.123225"},{"key":"73_CR26","doi-asserted-by":"crossref","unstructured":"R. Murgai, Y. Nishizaki, N. Shenoy, R.K. Brayton, and A. Sangiovanni-Vincentelli. Logic synthesis for programmable gate arrays. In Design Automation Conf., pages 620\u2013625, 1990.","DOI":"10.1145\/123186.123421"},{"key":"73_CR27","unstructured":"S. Panda and F. Somenzi. Who are the variables in your neighborhood. In Int'l Conf. on CAD, pages 74\u201377, 1995."},{"key":"73_CR28","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":"73_CR29","doi-asserted-by":"crossref","unstructured":"R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In Int'l Conf. on CAD, pages 42\u201347, 1993.","DOI":"10.1109\/ICCAD.1993.580029"},{"key":"73_CR30","unstructured":"S. Yang. Logic synthesis and and optimization benchmarks user guide. Technical Report 1\/95, Microelectronic Center of North Carolina, Jan. 1991."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2014 PPSN IV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61723-X_1036","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T20:22:04Z","timestamp":1555705324000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61723-X_1036"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617235","9783540706687"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-61723-x_1036","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}