{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:48:11Z","timestamp":1750308491475,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T00:00:00Z","timestamp":1662940800000},"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":[[2022,9,12]]},"DOI":"10.1145\/3551901.3556493","type":"proceedings-article","created":{"date-parts":[[2022,9,6]],"date-time":"2022-09-06T22:11:12Z","timestamp":1662502272000},"page":"83-90","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Scan Chain Clustering and Optimization with Constrained Clustering and Reinforcement Learning"],"prefix":"10.1145","author":[{"given":"Naiju Karim","family":"Abdul","sequence":"first","affiliation":[{"name":"IBM Systems, Bangalore, India"}]},{"given":"George","family":"Antony","sequence":"additional","affiliation":[{"name":"IBM Systems, Bangalore, India"}]},{"given":"Rahul M.","family":"Rao","sequence":"additional","affiliation":[{"name":"IBM Systems, Bangalore, India"}]},{"given":"Suriya T.","family":"Skariah","sequence":"additional","affiliation":[{"name":"IBM Systems, Bangalore, India"}]}],"member":"320","published-online":{"date-parts":[[2022,9,12]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_2_1_1","DOI":"10.1007\/s10479-011-1024-y"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_2_1","DOI":"10.1109\/ATS.2004.23"},{"key":"e_1_3_2_2_3_1","first-page":"301","volume-title":"Proceedings of 1998 ASPDAC","author":"Kobayashi S.","unstructured":"S. Kobayashi , M. Edahiro and M. Kubo , \" Scan-chain optimization algorithms for multiple scan-paths \", Proceedings of 1998 ASPDAC , pp. 301 -- 306 , doi: 10.1109\/ASPDAC.1998.669474. 10.1109\/ASPDAC.1998.669474 S. Kobayashi, M. Edahiro and M. Kubo, \"Scan-chain optimization algorithms for multiple scan-paths\", Proceedings of 1998 ASPDAC, pp. 301--306, doi: 10.1109\/ASPDAC.1998.669474."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_4_1","DOI":"10.1109\/TEST.2002.1041831"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_5_1","DOI":"10.1109\/TENCON.2006.344008"},{"key":"e_1_3_2_2_6_1","first-page":"6","volume-title":"7th ISQED","author":"Hsu Li-Chung","year":"2006","unstructured":"Li-Chung Hsu and Hung-Ming Chen , \"On optimizing scan testing power and routing cost in scan chain design \", 7th ISQED 2006 , pp. 6 pp.-456, doi: 10.1109\/ISQED.2006.95. 10.1109\/ISQED.2006.95 Li-Chung Hsu and Hung-Ming Chen, \"On optimizing scan testing power and routing cost in scan chain design\", 7th ISQED 2006, pp. 6 pp.-456, doi: 10.1109\/ISQED.2006.95."},{"key":"e_1_3_2_2_7_1","volume-title":"NIPS","author":"Dai H.","year":"2017","unstructured":"H. Dai , E.B. Khalil , Y. Zhang , C, Dilking, Le Song , \" Learning Combinatorial Optimization Algorithms over Graphs\" , NIPS 2017 , arXiv: 1704.01665 H. Dai, E.B. Khalil, Y.Zhang, C, Dilking, Le Song, \"Learning Combinatorial Optimization Algorithms over Graphs\", NIPS 2017, arXiv:1704.01665"},{"key":"e_1_3_2_2_8_1","volume-title":"Twelfth International Conf. on Machine Learning","author":"Gambardella L.M.","year":"1995","unstructured":"L.M. Gambardella , M. Dorigo , \"Ant-Q : A Reinforcement Learning approach to the traveling salesman problem\", ML-95 , Twelfth International Conf. on Machine Learning , 1995 L.M. Gambardella , M.Dorigo, \"Ant-Q: A Reinforcement Learning approach to the traveling salesman problem\", ML-95, Twelfth International Conf. on Machine Learning, 1995"},{"key":"e_1_3_2_2_9_1","first-page":"1","volume-title":"Comparing exploration strategies for Q-learning in random stochastic mazes","author":"Tijsma A. D.","year":"2016","unstructured":"A. D. Tijsma , M. M. Drugan and M. A. Wiering , \" Comparing exploration strategies for Q-learning in random stochastic mazes \", 2016 IEEE SSCI , 2016, pp. 1 -- 8 , doi: 10.1109\/SSCI.2016.7849366. 10.1109\/SSCI.2016.7849366 A. D. Tijsma, M. M. Drugan and M. A. Wiering, \"Comparing exploration strategies for Q-learning in random stochastic mazes\", 2016 IEEE SSCI, 2016, pp. 1--8, doi: 10.1109\/SSCI.2016.7849366."},{"volume-title":"An Introduction","author":"Barto R.","unstructured":"Sutton, R. S. & Barto , A. G. (2018 ), \" Reinforcement Learning : An Introduction \", The MIT Press Sutton, R. S. & Barto, A. G. (2018 ), \"Reinforcement Learning: An Introduction\", The MIT Press","key":"e_1_3_2_2_10_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_11_1","DOI":"10.1109\/ISSCC42614.2022.9731594"}],"event":{"sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CEDA"],"acronym":"MLCAD '22","name":"MLCAD '22: 2022 ACM\/IEEE Workshop on Machine Learning for CAD","location":"Virtual Event China"},"container-title":["Proceedings of the 2022 ACM\/IEEE Workshop on Machine Learning for CAD"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3551901.3556493","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3551901.3556493","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T18:43:35Z","timestamp":1750272215000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3551901.3556493"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,12]]},"references-count":11,"alternative-id":["10.1145\/3551901.3556493","10.1145\/3551901"],"URL":"https:\/\/doi.org\/10.1145\/3551901.3556493","relation":{},"subject":[],"published":{"date-parts":[[2022,9,12]]},"assertion":[{"value":"2022-09-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}