{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T17:40:49Z","timestamp":1730223649013,"version":"3.28.0"},"reference-count":8,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1109\/globecom38437.2019.9013908","type":"proceedings-article","created":{"date-parts":[[2020,2,28]],"date-time":"2020-02-28T09:59:24Z","timestamp":1582883964000},"page":"1-7","source":"Crossref","is-referenced-by-count":2,"title":["Significant Sampling for Shortest Path Routing: A Deep Reinforcement Learning Solution"],"prefix":"10.1109","author":[{"given":"Yulin","family":"Shao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arman","family":"Rezaee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soung Chang","family":"Liew","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent W. S.","family":"Chan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1038\/nature14539","article-title":"Deep learning","volume":"521","author":"lecun","year":"2015","journal-title":"Nature"},{"journal-title":"Markov Decision Processes Discrete Stochastic Dynamic Programming","year":"2014","author":"puterman","key":"ref3"},{"journal-title":"Deep reinforcement learning An overview","year":"2017","author":"li","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1038\/nature14236"},{"key":"ref8","article-title":"Deterministic policy gradient algorithms","author":"silver","year":"0","journal-title":"ICML"},{"journal-title":"Continuous control with deep reinforcement learning","year":"2015","author":"lillicrap","key":"ref7"},{"journal-title":"Reinforcement Learning An Introduction","year":"2018","author":"sutton","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8648066"}],"event":{"name":"GLOBECOM 2019 - 2019 IEEE Global Communications Conference","start":{"date-parts":[[2019,12,9]]},"location":"Waikoloa, HI, USA","end":{"date-parts":[[2019,12,13]]}},"container-title":["2019 IEEE Global Communications Conference (GLOBECOM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8968653\/9013108\/09013908.pdf?arnumber=9013908","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T21:55:07Z","timestamp":1658094907000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9013908\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":8,"URL":"https:\/\/doi.org\/10.1109\/globecom38437.2019.9013908","relation":{},"subject":[],"published":{"date-parts":[[2019,12]]}}}