{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T20:10:59Z","timestamp":1767989459447,"version":"3.49.0"},"reference-count":22,"publisher":"IEEE","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61874002,62004006"],"award-info":[{"award-number":["61874002,62004006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004826","name":"Beijing Municipal Natural Science Foundation","doi-asserted-by":"publisher","award":["2017ZX02315001"],"award-info":[{"award-number":["2017ZX02315001"]}],"id":[{"id":"10.13039\/501100004826","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2019YFB2205005"],"award-info":[{"award-number":["2019YFB2205005"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,2,1]]},"DOI":"10.23919\/date51398.2021.9474007","type":"proceedings-article","created":{"date-parts":[[2021,8,24]],"date-time":"2021-08-24T22:11:46Z","timestamp":1629843106000},"page":"1815-1820","source":"Crossref","is-referenced-by-count":10,"title":["Asynchronous Reinforcement Learning Framework for Net Order Exploration in Detailed Routing"],"prefix":"10.23919","author":[{"given":"Tong","family":"Qu","sequence":"first","affiliation":[]},{"given":"Yibo","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Zongqing","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Yajuan","family":"Su","sequence":"additional","affiliation":[]},{"given":"Yayi","family":"Wei","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3061639.3062214"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2014.2385755"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2228360.2228468"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2429384.2429408"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.7873\/DATE.2015.0413"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3240765.3240766"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2019.2927542"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD45719.2019.8942074"},{"key":"ref18","article-title":"Draps: A design rule aware path search algorithm for detailed routing","author":"gon\u00e7alves","year":"2019","journal-title":"IEEE Transactions on Circuits and Systems II Express Briefs"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3299874.3318026"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3177540.3177562"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1109\/TCAD.2012.2235124","article-title":"Nctu-gr 2.0: Multithreaded collision-aware global routing with bounded-length maze routing","volume":"32","author":"liu","year":"2013","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2009.2013991"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3299902.3311067"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2009.2013274"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2010.2066030"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-9260(03)00029-4"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-374364-0.50019-9"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2024724.2024763"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3240765.3240777"},{"key":"ref22","author":"mnih","year":"2016","journal-title":"Asynchronous methods for deep reinforcement learning"},{"key":"ref21","author":"liao","year":"2020","journal-title":"Attention routing track-assignment detailed routing using attention-based reinforcement learning"}],"event":{"name":"2021 Design, Automation & Test in Europe Conference & Exhibition (DATE)","location":"Grenoble, France","start":{"date-parts":[[2021,2,1]]},"end":{"date-parts":[[2021,2,5]]}},"container-title":["2021 Design, Automation & Test in Europe Conference & Exhibition (DATE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9473901\/9473226\/09474007.pdf?arnumber=9474007","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,28]],"date-time":"2022-01-28T19:58:44Z","timestamp":1643399924000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9474007\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,1]]},"references-count":22,"URL":"https:\/\/doi.org\/10.23919\/date51398.2021.9474007","relation":{},"subject":[],"published":{"date-parts":[[2021,2,1]]}}}