{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T03:29:04Z","timestamp":1725593344444},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"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,9]]},"DOI":"10.1109\/nca.2019.8935036","type":"proceedings-article","created":{"date-parts":[[2019,12,20]],"date-time":"2019-12-20T00:40:53Z","timestamp":1576802453000},"page":"1-8","source":"Crossref","is-referenced-by-count":0,"title":["Charger Scheduling Optimization Framework"],"prefix":"10.1109","author":[{"given":"Xuan","family":"Li","sequence":"first","affiliation":[]},{"given":"Miao","family":"Jin","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.1998.712192"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(91)90009-T"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/11564096_32"},{"journal-title":"Playing atari with deep reinforcement learning","year":"2013","author":"mnih","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007385"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1555816.1555849"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SECON.2012.6275766"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934919"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2015.2499783"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848051"},{"key":"ref8","first-page":"2702","article-title":"Discriminative embeddings of latent variable models for structured data","author":"dai","year":"0","journal-title":"International Conference on Machine Learning"},{"journal-title":"Optimal k-coverage charging problem","year":"2019","author":"li","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2942358.2942364"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2723605"},{"key":"ref9","first-page":"6351","article-title":"Learning combinatorial optimization algorithms over graphs","author":"khalil","year":"0","journal-title":"Advances in neural information processing systems"}],"event":{"name":"2019 IEEE 18th International Symposium on Network Computing and Applications (NCA)","start":{"date-parts":[[2019,9,26]]},"location":"Cambridge, MA, USA","end":{"date-parts":[[2019,9,28]]}},"container-title":["2019 IEEE 18th International Symposium on Network Computing and Applications (NCA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8930311\/8935004\/08935036.pdf?arnumber=8935036","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T21:52:06Z","timestamp":1658094726000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8935036\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/nca.2019.8935036","relation":{},"subject":[],"published":{"date-parts":[[2019,9]]}}}