{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T22:12:25Z","timestamp":1759961545504,"version":"3.37.3"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100010418","name":"Institute for Information and Communications Technology Promotion","doi-asserted-by":"publisher","award":["2021-0-00779"],"award-info":[{"award-number":["2021-0-00779"]}],"id":[{"id":"10.13039\/501100010418","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3120384","type":"journal-article","created":{"date-parts":[[2021,10,15]],"date-time":"2021-10-15T23:44:30Z","timestamp":1634341470000},"page":"142195-142205","source":"Crossref","is-referenced-by-count":3,"title":["SpecMCTS: Accelerating Monte Carlo Tree Search Using Speculative Tree Traversal"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8859-9702","authenticated-orcid":false,"given":"Juhwan","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1106-9196","authenticated-orcid":false,"given":"Byeongmin","family":"Kang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8705-7066","authenticated-orcid":false,"given":"Hyungmin","family":"Cho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"940","article-title":"A multi-neural network acceleration architecture","author":"baek","year":"2020","journal-title":"Proc ISCA"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-011-9258-6"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2010.2096427"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/653"},{"key":"ref14","article-title":"Learning to stop: Dynamic simulation monte-carlo tree search","author":"lan","year":"2020","journal-title":"arXiv 2012 07910"},{"key":"ref15","first-page":"1","article-title":"Learning both weights and connections for efficient neural network","author":"han","year":"2015","journal-title":"Proc NIPS"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00286"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2020.2976475"},{"key":"ref18","article-title":"Distilling the knowledge in a neural network","author":"hinton","year":"2015","journal-title":"Proc NIPS DEEP Learn Workshop"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/94"},{"key":"ref4","first-page":"6244","article-title":"ELF OpenGo: An analysis and open reimplementation of AlphaZero","author":"tian","year":"2019","journal-title":"Proc ICML"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1038\/nature24270","article-title":"Mastering the game of go without human knowledge","volume":"550","author":"silver","year":"2017","journal-title":"Nature"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/978-3-540-87608-3_6","article-title":"Parallel Monte-Carlo tree search","author":"chaslot","year":"2008","journal-title":"Proc Int Conf Comput Games"},{"key":"ref5","article-title":"Bandit based Monte-Carlo planning","author":"kocsis","year":"2006","journal-title":"Proc Euro Conf Mach Learn"},{"key":"ref8","article-title":"Watch the unobserved: A simple approach to parallelizing Monte Carlo tree search","author":"liu","year":"2020","journal-title":"Proc ICLR"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2186810"},{"key":"ref2","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":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA47549.2020.00027"},{"key":"ref1","first-page":"3338","article-title":"Deep learning for real-time Atari game play using offline Monte-Carlo tree search planning","author":"guo","year":"2014","journal-title":"Proc NIPS"},{"key":"ref20","article-title":"Pruning filters for efficient convnets","author":"li","year":"2016","journal-title":"arXiv 11608 08710"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00890"},{"key":"ref21","first-page":"1","article-title":"Deep compression: Compressing deep neural network with pruning, trained quantization and Huffman coding","author":"han","year":"2016","journal-title":"Proc ICLR"},{"journal-title":"Nvidia tensorrt - programmable inference accelerator","year":"2021","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00160"},{"key":"ref25","article-title":"Minigo: A case study in reproducing reinforcement learning research","author":"lee","year":"2019","journal-title":"Proc ICLR"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09576093.pdf?arnumber=9576093","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,21]],"date-time":"2022-02-21T22:13:37Z","timestamp":1645481617000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9576093\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3120384","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2021]]}}}