{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T07:00:49Z","timestamp":1760079649650,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,11,5]],"date-time":"2012-11-05T00:00:00Z","timestamp":1352073600000},"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":[[2012,11,5]]},"DOI":"10.1145\/2429384.2429428","type":"proceedings-article","created":{"date-parts":[[2013,1,22]],"date-time":"2013-01-22T15:29:29Z","timestamp":1358868569000},"page":"233-239","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":49,"title":["Sensitivity-guided metaheuristics for accurate discrete gate sizing"],"prefix":"10.1145","author":[{"given":"Jin","family":"Hu","sequence":"first","affiliation":[{"name":"University of Michigan, Ann Arbor, MI"}]},{"given":"Andrew B.","family":"Kahng","sequence":"additional","affiliation":[{"name":"UC San Diego, La Jolla, CA and University of Michigan, Ann Arbor, MI"}]},{"given":"SeokHyeong","family":"Kang","sequence":"additional","affiliation":[{"name":"UC San Diego, La Jolla, CA"}]},{"given":"Myung-Chul","family":"Kim","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, MI"}]},{"given":"Igor L.","family":"Markov","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, MI"}]}],"member":"320","published-online":{"date-parts":[[2012,11,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365742"},{"key":"e_1_3_2_1_2_1","first-page":"217","volume-title":"Proc. EURO-DAC","author":"Berkelaar M. R. C. M.","year":"1990","unstructured":"M. R. C. M. Berkelaar and J. A. G. Jess , \"Gate Sizing in MOS Digital Circuits with Linear Programming\" , Proc. EURO-DAC , 1990 , pp. 217 -- 221 . M. R. C. M. Berkelaar and J. A. G. Jess, \"Gate Sizing in MOS Digital Circuits with Linear Programming\", Proc. EURO-DAC, 1990, pp. 217--221."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(94)90065-5"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.771182"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1077603.1077642"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1120725.1120881"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/92.645073"},{"key":"e_1_3_2_1_8_1","first-page":"326","volume-title":"Proc. ICCAD","author":"Fishburn J. P.","year":"1985","unstructured":"J. P. Fishburn and A. E. Dunlop , \" Tilos: A Posynomial Programming Approach to Transistor Sizing \", Proc. ICCAD , 1985 , pp. 326 -- 328 . J. P. Fishburn and A. E. Dunlop, \"Tilos: A Posynomial Programming Approach to Transistor Sizing\", Proc. ICCAD, 1985, pp. 326--328."},{"key":"e_1_3_2_1_9_1","volume-title":"Handbook of Approximation Algorithms and Metaheuristics, Chapman and Hall\/CRC","author":"Gonzalez T. F.","year":"2007","unstructured":"T. F. Gonzalez (editor), Handbook of Approximation Algorithms and Metaheuristics, Chapman and Hall\/CRC 2007 . T. F. Gonzalez (editor), Handbook of Approximation Algorithms and Metaheuristics, Chapman and Hall\/CRC 2007."},{"key":"e_1_3_2_1_10_1","unstructured":"P. Grassberger \"Go with the Winners: A General Monte Carlo Strategy\" http:\/\/arxiv.org\/pdf\/cond-mat\/0201313v1.pdf.  P. Grassberger \"Go with the Winners: A General Monte Carlo Strategy\" http:\/\/arxiv.org\/pdf\/cond-mat\/0201313v1.pdf."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/996566.996661"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISQED.2005.13"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.857313"},{"key":"e_1_3_2_1_14_1","first-page":"827","volume-title":"Proc. DATE","author":"Held S.","year":"2009","unstructured":"S. Held , \"Gate Sizing for Large Cell-Based Designs\" , Proc. DATE , 2009 , pp. 827 -- 832 . S. Held, \"Gate Sizing for Large Cell-Based Designs\", Proc. DATE, 2009, pp. 827--832."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2009.2015735"},{"key":"e_1_3_2_1_16_1","unstructured":"IWLS 2005 Benchmarks http:\/\/iwls.org\/iwls2005\/benchmarks.html  IWLS 2005 Benchmarks http:\/\/iwls.org\/iwls2005\/benchmarks.html"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISQED.2009.4810282"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.298040"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2009.2035575"},{"key":"e_1_3_2_1_20_1","volume-title":"DAC Knowledge Center Article","author":"MacDonald N. D.","year":"2010","unstructured":"N. D. MacDonald , \"Timing Closure in Deep Submicron Designs\" , DAC Knowledge Center Article , 2010 . N. D. MacDonald, \"Timing Closure in Deep Submicron Designs\", DAC Knowledge Center Article, 2010."},{"issue":"3","key":"e_1_3_2_1_21_1","first-page":"299","article-title":"Large-Step Markov Chains for the Traveling Salesman Problem","volume":"5","author":"Martin O.","year":"1991","unstructured":"O. Martin , S. W. Otto and E. W. Felten , \" Large-Step Markov Chains for the Traveling Salesman Problem \", Complex Systems 5 ( 3 ) ( 1991 ), pp. 299 -- 326 . O. Martin, S. W. Otto and E. W. Felten, \"Large-Step Markov Chains for the Traveling Salesman Problem\", Complex Systems 5(3) (1991), pp. 299--326.","journal-title":"Complex Systems"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/2132325.2132484"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2160916.2160950"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2011.5763293"},{"key":"e_1_3_2_1_25_1","first-page":"7","volume-title":"Proc. IWLS","author":"Ren H.","year":"2008","unstructured":"H. Ren and S. Dutt , \" A Network-Flow Based Cell Sizing Algorithm \", Proc. IWLS , 2008 , pp. 7 -- 14 . H. Ren and S. Dutt, \"A Network-Flow Based Cell Sizing Algorithm\", Proc. IWLS, 2008, pp. 7--14."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.895793"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.248073"},{"key":"e_1_3_2_1_28_1","first-page":"704","volume-title":"Proc. ICCAD","author":"Shah S.","year":"2005","unstructured":"S. Shah , A. Srivastava , D. Sharma , D. Sylvester , D. Blaauw and V. Zolotov , \" Discrete Vt Assignment and Gate Sizing Using a Self-Snapping Continuous Formulation \", Proc. ICCAD , 2005 , pp. 704 -- 711 . S. Shah, A. Srivastava, D. Sharma, D. Sylvester, D. Blaauw and V. Zolotov, \"Discrete Vt Assignment and Gate Sizing Using a Self-Snapping Continuous Formulation\", Proc. ICCAD, 2005, pp. 704--711."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/996566.996777"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/774572.774631"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2009.2018872"},{"key":"e_1_3_2_1_32_1","first-page":"413","article-title":"Power Minimization by Simultaneous Dual-Vth Assignment and Gate-Sizing","author":"Wei L.","year":"2000","unstructured":"L. Wei , K. Roy and C. Koh , \" Power Minimization by Simultaneous Dual-Vth Assignment and Gate-Sizing \", Proc. CICC , 2000 , pp. 413 -- 416 . L. Wei, K. Roy and C. Koh, \"Power Minimization by Simultaneous Dual-Vth Assignment and Gate-Sizing\", Proc. CICC, 2000, pp. 413--416.","journal-title":"Proc."},{"key":"e_1_3_2_1_33_1","unstructured":"Synopsys PrimeTime User's Manual http:\/\/www.synopsys.com. Synopsys PrimeTime User's Manual http:\/\/www.synopsys.com."}],"event":{"name":"ICCAD '12: The International Conference on Computer-Aided Design","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CEDA"],"location":"San Jose California","acronym":"ICCAD '12"},"container-title":["Proceedings of the International Conference on Computer-Aided Design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2429384.2429428","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2429384.2429428","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:35:26Z","timestamp":1750235726000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2429384.2429428"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,5]]},"references-count":33,"alternative-id":["10.1145\/2429384.2429428","10.1145\/2429384"],"URL":"https:\/\/doi.org\/10.1145\/2429384.2429428","relation":{},"subject":[],"published":{"date-parts":[[2012,11,5]]},"assertion":[{"value":"2012-11-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}