{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T17:53:25Z","timestamp":1772906005949,"version":"3.50.1"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"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":["IEEE Trans. Cogn. Commun. Netw."],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1109\/tccn.2020.3012445","type":"journal-article","created":{"date-parts":[[2020,7,28]],"date-time":"2020-07-28T21:47:57Z","timestamp":1595972877000},"page":"279-293","source":"Crossref","is-referenced-by-count":28,"title":["Multi-Armed Bandit for Energy-Efficient and Delay-Sensitive Edge Computing in Dynamic Networks With Uncertainty"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1095-6236","authenticated-orcid":false,"given":"Saeed","family":"Ghoorchian","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0647-611X","authenticated-orcid":false,"given":"Setareh","family":"Maghsudi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","article-title":"Distinguishing between binomial, hypergeometric and negative binomial distributions","volume":"21","author":"wroughton","year":"2013","journal-title":"Journal of Educational Statistics"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2018.8406881"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2019.2895593"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8647564"},{"key":"ref13","first-page":"232","article-title":"Multi-armed bandit with budget constraint and variable costs","author":"ding","year":"2013","journal-title":"Proc 27th AAAI Conf Artif Intell"},{"key":"ref14","first-page":"3960","article-title":"Thompson sampling for budgeted multi-armed bandits","author":"xia","year":"2015","journal-title":"Proc 24th Int Conf Artif Intell (IJCAI)"},{"key":"ref15","first-page":"1134","article-title":"Knapsack based optimal policies for budget-limited multi-armed bandits","author":"tran-thanh","year":"2012","journal-title":"Proc 26th AAAI Conf Artif Intell"},{"key":"ref16","author":"garivier","year":"2008","journal-title":"On Upper-confidence Bound Policies for Non-stationary Bandit Problems"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/LWC.2017.2773598"},{"key":"ref18","first-page":"317","article-title":"Budgeted bandit problems with continuous random costs","author":"xia","year":"2015","journal-title":"Proc Asian Conf Mach Learn (ACML)"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-013-0620-y"},{"key":"ref28","author":"cormen","year":"2009","journal-title":"Introduction to Algorithms Third Edition"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1952-09620-8"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2016.7498076"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISCO.2016.7727082"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/PIMRC.2017.8292514"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398375"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2800032"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2017.2699660"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2017.2750180"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2012.041912.110912"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8057148"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1561\/9781601982650"},{"key":"ref22","article-title":"Basic queueing theory","author":"sztrik","year":"2016","journal-title":"Foundations of System Performance Modeling"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2009.090902"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1984.1096061"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/LWC.2018.2810292"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88582-5_9"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1023\/A:1023434702987"}],"container-title":["IEEE Transactions on Cognitive Communications and Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6687307\/9371452\/09151218.pdf?arnumber=9151218","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:06Z","timestamp":1652194446000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9151218\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3]]},"references-count":30,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tccn.2020.3012445","relation":{},"ISSN":["2332-7731","2372-2045"],"issn-type":[{"value":"2332-7731","type":"electronic"},{"value":"2372-2045","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3]]}}}