{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:56:39Z","timestamp":1753440999646,"version":"3.37.3"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001602","name":"Science Foundation Ireland Centre for Research Training in Digitally-Enhanced Reality","doi-asserted-by":"publisher","award":["18\/CRT\/6224"],"award-info":[{"award-number":["18\/CRT\/6224"]}],"id":[{"id":"10.13039\/501100001602","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001602","name":"Science Foundation Ireland (SFI) under Research (Enable) and Research Grant","doi-asserted-by":"publisher","award":["16\/SP\/3804","12\/RC\/2289_P2"],"award-info":[{"award-number":["16\/SP\/3804","12\/RC\/2289_P2"]}],"id":[{"id":"10.13039\/501100001602","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Wireless Commun."],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1109\/twc.2021.3116881","type":"journal-article","created":{"date-parts":[[2021,9,30]],"date-time":"2021-09-30T21:08:06Z","timestamp":1633036086000},"page":"2892-2908","source":"Crossref","is-referenced-by-count":7,"title":["Reduced Complexity Optimal Resource Allocation for Enhanced Video Quality in a Heterogeneous Network Environment"],"prefix":"10.1109","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4040-8145","authenticated-orcid":false,"given":"Bharat","family":"Agarwal","sequence":"first","affiliation":[{"name":"School of Electronics Engineering, Dublin City University, Dublin 9, Ireland"}]},{"given":"Marco","family":"Ruffini","sequence":"additional","affiliation":[{"name":"Computer Science and Statistic Department, Trinity College Dublin, Dublin 2, Ireland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9332-4770","authenticated-orcid":false,"given":"Gabriel-Miro","family":"Muntean","sequence":"additional","affiliation":[{"name":"School of Electronics Engineering, Dublin City University, Dublin 9, Ireland"}]}],"member":"263","reference":[{"volume-title":"Ericsson Mobility Report November 2020","year":"2020","key":"ref1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2015.2496958"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2017.2787139"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.7296381"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/VTCFall.2017.8288227"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2017.2678986"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2019.2937941"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524624"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2017.2654458"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/167031"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.5772\/1142"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/wics.73"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.15406\/bbij.2017.05.00133"},{"key":"ref14","first-page":"11","article-title":"A racing algorithm for configuring metaheuristics","volume-title":"Proc. 4th Annu. Conf. Genetic Evol. Comput.","author":"Birattari"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02538-9_13"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/3502394"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/MELCON.2014.6820555"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2019.2912611"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2016.2613864"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/PIMRC.2018.8580784"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/PuneCon46936.2019.9105736"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/LCN48667.2020.9314834"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICCWorkshops50388.2021.9473705"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISDA.2006.253776"},{"article-title":"Deep learning using genetic algorithm","year":"2012","author":"Lamos-Sweeney","key":"ref25"},{"volume-title":"Deepmind","year":"2021","key":"ref26"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2015.12.114"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/0895-7177(93)90204-C"},{"key":"ref29","article-title":"Reinforcement learning driven heuristic optimization","author":"Cai","year":"2019","journal-title":"arXiv:1906.06639"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-018-1177-x"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-05755-8_16"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2904353"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2565198"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2017.2760281"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2864373"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2018.1700202"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11694"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/MVT.2019.2903655"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2019.2933417"},{"volume-title":"Time Complexity of ML Models","year":"2021","author":"Kumar","key":"ref40"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2013.2293637"},{"key":"ref42","first-page":"1540","article-title":"Learning complexity of simulated annealing","volume-title":"Proc. Mach. Learn. Res.","volume":"130","author":"Blum"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1002\/9780470496916"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.orp.2016.09.002"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2014.10.008"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.2307\/2686057"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1186\/s13638-016-0588-2"},{"volume-title":"Evolved Universal Terrestrial Radio Access (E-UTRA); Physical Layer Procedures","year":"2020","key":"ref48"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/CCNC.2017.7983229"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/APCC.2015.7412505"},{"key":"ref51","first-page":"320","article-title":"Simulated annealing for the 0\/1 multidimensional knapsack problem","volume":"16","author":"Qian","year":"2007","journal-title":"Numer. Math."}],"container-title":["IEEE Transactions on Wireless Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7693\/9771299\/09552957.pdf?arnumber=9552957","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T22:26:30Z","timestamp":1705011990000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9552957\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5]]},"references-count":51,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/twc.2021.3116881","relation":{},"ISSN":["1536-1276","1558-2248"],"issn-type":[{"type":"print","value":"1536-1276"},{"type":"electronic","value":"1558-2248"}],"subject":[],"published":{"date-parts":[[2022,5]]}}}