{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,10]],"date-time":"2025-05-10T06:40:10Z","timestamp":1746859210843,"version":"3.40.5"},"reference-count":12,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T00:00:00Z","timestamp":1742774400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T00:00:00Z","timestamp":1742774400000},"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":[[2025,3,24]]},"DOI":"10.1109\/wcnc61545.2025.10978211","type":"proceedings-article","created":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T17:53:33Z","timestamp":1746813213000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["A Policy Reuse Reinforcement Learning Framework for Hard Latency Constrained Resource Scheduling"],"prefix":"10.1109","author":[{"given":"Luyuan","family":"Zhang","sequence":"first","affiliation":[{"name":"College of Information Science and Electronic Engineering, Zhejiang University"}]},{"given":"An","family":"Liu","sequence":"additional","affiliation":[{"name":"College of Information Science and Electronic Engineering, Zhejiang University"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1007\/s11432-020-2955-6"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/noms56928.2023.10154267"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/MNET.2018.1700268"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/NTMS.2019.8763780"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/GLOBECOM46510.2021.9685604"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/TNSM.2020.3040907"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/ICC.2018.8422088"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1145\/1160633.1160762"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/TENCON58879.2023.10322371"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/ACCESS.2021.3062457"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/TSP.2022.3158737"},{"key":"ref12","first-page":"820","article-title":"Low complexity multiuser MIMO scheduling for weighted sum rate maximization","volume-title":"2014 22nd European Signal Processing Conference (EUSIPCO). IEEE","author":"Venkatraman","year":"2014"}],"event":{"name":"2025 IEEE Wireless Communications and Networking Conference (WCNC)","start":{"date-parts":[[2025,3,24]]},"location":"Milan, Italy","end":{"date-parts":[[2025,3,27]]}},"container-title":["2025 IEEE Wireless Communications and Networking Conference (WCNC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10978109\/10978116\/10978211.pdf?arnumber=10978211","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,10]],"date-time":"2025-05-10T06:23:53Z","timestamp":1746858233000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10978211\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,24]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/wcnc61545.2025.10978211","relation":{},"subject":[],"published":{"date-parts":[[2025,3,24]]}}}