{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T09:02:52Z","timestamp":1773997372231,"version":"3.50.1"},"reference-count":18,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,12,8]]},"DOI":"10.1109\/globecom59602.2025.11431752","type":"proceedings-article","created":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T20:04:01Z","timestamp":1773950641000},"page":"3499-3504","source":"Crossref","is-referenced-by-count":0,"title":["Heuristic-guided Migration-Agent-Based DRL for Compressed Model Placement in Edge Networks"],"prefix":"10.1109","author":[{"given":"Chao","family":"Wang","sequence":"first","affiliation":[{"name":"Southwest Jiaotong University,School of Computing and Artificial Intelligence,China"}]},{"given":"Danyang","family":"Zheng","sequence":"additional","affiliation":[{"name":"Southwest Jiaotong University,School of Computing and Artificial Intelligence,China"}]},{"given":"Yihan","family":"Zhong","sequence":"additional","affiliation":[{"name":"Georgia State University,Department of Computer Science,USA"}]},{"given":"Honghui","family":"Xu","sequence":"additional","affiliation":[{"name":"Kennesaw State University,Department of Information Technology,USA"}]},{"given":"Xiaojun","family":"Cao","sequence":"additional","affiliation":[{"name":"Georgia State University,Department of Computer Science,USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN60899.2024.10650109"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2025.3593234"},{"key":"ref3","article-title":"Distilbert, a distilled version of bert: smaller, faster, cheaper and lighter","author":"Sanh","year":"2019"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1080\/07408179608966256"},{"key":"ref5","first-page":"265","article-title":"Approximation algorithms for facility location problems","volume-title":"Proc. ACM STOC","author":"Shmoys"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2025.3538525"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.3934\/jimo.2024146"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2024.3475248"},{"key":"ref9","first-page":"2721","article-title":"Count-based exploration with neural density models","volume-title":"Proc. PMLR ICLR","author":"Ostrovski"},{"key":"ref10","article-title":"Temporal difference models: Model-free deep RL for model-based control","volume-title":"Proc. ICLR","author":"Pong"},{"key":"ref11","article-title":"Ride: Rewarding impact-driven exploration for procedurally-generated environments","volume-title":"Proc. ICLR","author":"Raileanu"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3678717.3691249"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1111\/tgis.13252"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICC51166.2024.10622220"},{"key":"ref15","article-title":"Proximal policy optimization algorithms","author":"Schulman","year":"2017"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155529"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2024.110843"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2024.111002"}],"event":{"name":"GLOBECOM 2025 - 2025 IEEE Global Communications Conference","location":"Taipei, Taiwan","start":{"date-parts":[[2025,12,8]]},"end":{"date-parts":[[2025,12,12]]}},"container-title":["GLOBECOM 2025 - 2025 IEEE Global Communications Conference"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11431620\/11431622\/11431752.pdf?arnumber=11431752","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T05:32:22Z","timestamp":1773984742000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11431752\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/globecom59602.2025.11431752","relation":{},"subject":[],"published":{"date-parts":[[2025,12,8]]}}}