{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T13:08:09Z","timestamp":1730207289768,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"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,8]]},"DOI":"10.1109\/cig.2019.8848077","type":"proceedings-article","created":{"date-parts":[[2019,9,27]],"date-time":"2019-09-27T01:49:14Z","timestamp":1569548954000},"page":"1-7","source":"Crossref","is-referenced-by-count":3,"title":["Parallel Nested Rollout Policy Adaptation"],"prefix":"10.1109","author":[{"given":"Andrzej","family":"Nagorko","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2014.6932882"},{"key":"ref11","article-title":"Monte-carlo tree search for the multiple sequence alignment problem","author":"edelkamp","year":"2015","journal-title":"Eighth Annual Symposium on Combinatorial Search"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SCIS.2013.6613251"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37198-1_17"},{"article-title":"New Heuristics for Morpion Solitaire","year":"2007","author":"hyyr\u00f6","key":"ref14"},{"key":"ref15","article-title":"485 - A new upper bound for Morpion Solitaire","author":"michalewski","year":"2015","journal-title":"CGW IJCAI"},{"key":"ref16","article-title":"Distributed Nested Roll-out Policy for SameGame","volume":"818","author":"negrevergne b","year":"2018","journal-title":"Computer Games CGW 2017"},{"key":"ref17","first-page":"5690","article-title":"Imagination-augmented agents for deep reinforcement learning","author":"racani\u00e8re","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref18","first-page":"649","article-title":"Nested Rollout Policy Adaptation for Monte Carlo Tree Search","author":"rosin","year":"2011","journal-title":"IJCAI"},{"journal-title":"Morpion Solitaire","year":"2015","author":"boyer","key":"ref4"},{"key":"ref3","first-page":"109","article-title":"Nested Monte-Carlo Tree Search for Online Planning in Large MDPs","volume":"242","author":"baier","year":"2012","journal-title":"ECAI"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-005-1240-4"},{"key":"ref5","first-page":"42","article-title":"Application of the nested rollout policy adaptation algorithm to the traveling salesman problem with time windows","author":"cazenave","year":"2011","journal-title":"LION"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11206-0_28"},{"key":"ref7","first-page":"22","article-title":"Solving single vehicle pickup and delivery problems with time windows and capacity constraints using nested monte-carlo search","author":"edelkamp","year":"2014","journal-title":"Proceedings of the 6th International Conference on Agents and Artificial Intelligence-Volume 1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/nature24270"},{"article-title":"A computer generated Morpion 5T grid consisting of 145 moves","year":"2010","author":"akiyama","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46073-4_14"}],"event":{"name":"2019 IEEE Conference on Games (CoG)","start":{"date-parts":[[2019,8,20]]},"location":"London, United Kingdom","end":{"date-parts":[[2019,8,23]]}},"container-title":["2019 IEEE Conference on Games (CoG)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8844551\/8847948\/08848077.pdf?arnumber=8848077","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T14:51:30Z","timestamp":1658155890000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8848077\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/cig.2019.8848077","relation":{},"subject":[],"published":{"date-parts":[[2019,8]]}}}