{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T17:29:44Z","timestamp":1764350984562,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T00:00:00Z","timestamp":1725840000000},"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":[[2024,9,9]]},"DOI":"10.1145\/3670474.3685945","type":"proceedings-article","created":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T06:22:27Z","timestamp":1725344547000},"page":"1-7","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["IR-Aware ECO Timing Optimization Using Reinforcement Learning"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0956-9602","authenticated-orcid":false,"given":"Wenjing","family":"Jiang","sequence":"first","affiliation":[{"name":"University of Minnesota, Minneapolis, MN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3273-0724","authenticated-orcid":false,"given":"Vidya A.","family":"Chhabria","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5353-2364","authenticated-orcid":false,"given":"Sachin S.","family":"Sapatnekar","sequence":"additional","affiliation":[{"name":"University of Minnesota, Minneapolis, MN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,9,9]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2024. OpenROAD. https:\/\/github.com\/The-OpenROAD-Project\/OpenROAD."},{"key":"e_1_3_2_1_2_1","unstructured":"S. Boyd and L. Vandenberghe. 2009. Convex Optimization. Cambridge University Press Cambridge UK."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2013.2272540"},{"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.1109\/ASP-DAC47756.2020.9045303"},{"volume-title":"Proc. ICCAD. 326--328","author":"Fishburn J. P.","key":"e_1_3_2_1_6_1","unstructured":"J. P. Fishburn and A. E. Dunlop. 1985. TILOS: A Posynomial Programming Approach to Transistor Sizing. In Proc. ICCAD. 326--328."},{"volume-title":"Proc. ICCAD","author":"Hu J.","key":"e_1_3_2_1_7_1","unstructured":"J. Hu, A. B. Kahng, S. Kang, M.-C. Kim, and I. L. Markov. 2012. Sensitivity-Guided Metaheuristics for Accurate Discrete Gate Sizing. In Proc. ICCAD (San Jose, California). 233--239."},{"key":"e_1_3_2_1_8_1","volume-title":"Proc. CoRL. 883--893","author":"Huang S.","year":"2022","unstructured":"S. Huang et al. 2022. A Constrained Multi-Objective Reinforcement Learning Framework. In Proc. CoRL. 883--893."},{"key":"e_1_3_2_1_9_1","unstructured":"A. Irpan. 2018. Deep Reinforcement Learning Doesn't Work Yet. https:\/\/www. alexirpan.com\/2018\/02\/14\/rl-hard.html."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.851993"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"J. Lee and P. Gupta. 2013. ECO Cost Measurement and Incremental Gate Sizing for Late Process Changes. ACM T. Des. Automat. El. 18 1 Article 16 (Jan. 2013).","DOI":"10.1145\/2390191.2390207"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ITC-Asia51099.2020.00013"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18074.2021.9586138"},{"key":"e_1_3_2_1_14_1","volume-title":"Proc. NeurIPS.","author":"Mnih V.","year":"2013","unstructured":"V. Mnih et al. 2013. Playing Atari With Deep Reinforcement Learning. In Proc. NeurIPS."},{"key":"e_1_3_2_1_15_1","volume-title":"Proc. ICCAD.","author":"Ren H.","year":"2021","unstructured":"H. Ren et al. 2021. Optimizing VLSI Implementation with Reinforcement Learning. In Proc. ICCAD."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2019.2915324"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/981066.981072"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18072.2020.9218757"},{"key":"e_1_3_2_1_19_1","unstructured":"M. Wang et al. 2020. Deep Graph Library: A Graph-Centric Highly-Performant Package for Graph Neural Networks. In arXiv:1909.01315."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3508352.3549361"}],"event":{"name":"MLCAD '24: 2024 ACM\/IEEE International Symposium on Machine Learning for CAD","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CEDA"],"location":"Salt Lake City UT USA","acronym":"MLCAD '24"},"container-title":["Proceedings of the 2024 ACM\/IEEE International Symposium on Machine Learning for CAD"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3670474.3685945","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3670474.3685945","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T23:44:38Z","timestamp":1755906278000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3670474.3685945"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,9]]},"references-count":20,"alternative-id":["10.1145\/3670474.3685945","10.1145\/3670474"],"URL":"https:\/\/doi.org\/10.1145\/3670474.3685945","relation":{},"subject":[],"published":{"date-parts":[[2024,9,9]]},"assertion":[{"value":"2024-09-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}