{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:38:20Z","timestamp":1729654700097,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"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,12]]},"DOI":"10.1109\/cdc40024.2019.9030099","type":"proceedings-article","created":{"date-parts":[[2020,3,13]],"date-time":"2020-03-13T00:43:11Z","timestamp":1584060191000},"page":"6332-6337","source":"Crossref","is-referenced-by-count":6,"title":["Monte Carlo tree search with optimal computing budget allocation"],"prefix":"10.1109","author":[{"given":"Yunchuan","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008349927281"},{"key":"ref11","first-page":"379","article-title":"Combinatorial pure exploration of multi-armed bandits","volume":"27","author":"chen","year":"2014","journal-title":"Advances in neural information processing systems"},{"article-title":"Bandit algorithms for tree search","year":"2007","author":"coquelin","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75538-8_7"},{"journal-title":"Optimal Statistical Decisions","year":"1970","author":"degroot","key":"ref14"},{"key":"ref15","first-page":"4680","article-title":"Blazing the trails before beating the path: Sample-efficient Monte-Carlo planning","volume":"29","author":"grill","year":"2016","journal-title":"Advances in neural information processing systems"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2007.4425000"},{"key":"ref17","first-page":"4897","article-title":"Monte-Carlo tree search by best arm identification","volume":"30","author":"kaufmann","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref18","first-page":"282","article-title":"Bandit based Monte-Carlo planning","author":"kocsis","year":"2006","journal-title":"ECML’06 Proceedings of the 17th European conference on Machine Learning"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref4","first-page":"456","article-title":"Nested Monte-Carlo search","author":"cazenave","year":"2009","journal-title":"Proceedings of the 21st International Joint Conference on Artifical Intelligence IJCAI’09"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04414-4_7"},{"key":"ref6","first-page":"2598","article-title":"An effective approach to smartly allocate computing budget for discrete event simulation","volume":"3","author":"chen","year":"1995","journal-title":"Proceedings of 34th IEEE conference on Decision and control"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1040.0145"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1080.0268"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2006.884993"},{"journal-title":"Dynamic Programming and Optimal Control","year":"1995","author":"bertsekas","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1142\/7437"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref20","first-page":"586","article-title":"Optimal computing budget allocation for multi-objective simulation models","author":"lee","year":"2004","journal-title":"Proceedings of the 2004 Winter Simulation Conference"},{"key":"ref22","article-title":"Selective search in games of different complexity","author":"schadd","year":"2011","journal-title":"PhD thesis"},{"key":"ref21","article-title":"An adaptive tree search algorithm with optimal computing budget allocation","author":"li","year":"2019","journal-title":"Working Paper"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1038\/nature16961","article-title":"Mastering the game of go with deep neural networks and tree search","volume":"529","author":"silver","year":"2016","journal-title":"Nature"},{"key":"ref23","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v29i1.9688","article-title":"On interruptible pure exploration in multi-armed bandits","author":"shleyfman","year":"2015","journal-title":"AAAI Conference on Artificial Intelligence"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2015.2423832"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.E97.D.392"}],"event":{"name":"2019 IEEE 58th Conference on Decision and Control (CDC)","start":{"date-parts":[[2019,12,11]]},"location":"Nice, France","end":{"date-parts":[[2019,12,13]]}},"container-title":["2019 IEEE 58th Conference on Decision and Control (CDC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8977134\/9028853\/09030099.pdf?arnumber=9030099","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,28]],"date-time":"2023-09-28T11:00:35Z","timestamp":1695898835000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9030099\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/cdc40024.2019.9030099","relation":{},"subject":[],"published":{"date-parts":[[2019,12]]}}}