{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T08:41:22Z","timestamp":1772268082897,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642255656","type":"print"},{"value":"9783642255663","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25566-3_32","type":"book-chapter","created":{"date-parts":[[2011,11,14]],"date-time":"2011-11-14T04:19:51Z","timestamp":1321244391000},"page":"433-445","source":"Crossref","is-referenced-by-count":92,"title":["Continuous Upper Confidence Trees"],"prefix":"10.1007","author":[{"given":"Adrien","family":"Cou\u00ebtoux","sequence":"first","affiliation":[]},{"given":"Jean-Baptiste","family":"Hoock","sequence":"additional","affiliation":[]},{"given":"Nataliya","family":"Sokolovska","sequence":"additional","affiliation":[]},{"given":"Olivier","family":"Teytaud","sequence":"additional","affiliation":[]},{"given":"Nicolas","family":"Bonnard","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","first-page":"397","volume":"3","author":"P. Auer","year":"2003","unstructured":"Auer, P.: Using confidence bounds for exploitation-exploration trade-offs. The Journal of Machine Learning Research\u00a03, 397\u2013422 (2003)","journal-title":"The Journal of Machine Learning Research"},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1142\/9789812709677_0246","volume-title":"Proceedings of the 10th Joint Conference on Information Sciences (JCIS 2007)","author":"G. Chaslot","year":"2007","unstructured":"Chaslot, G., Winands, M., Uiterwijk, J., van den Herik, H., Bouzy, B.: Progressive Strategies for Monte-Carlo Tree Search. In: Wang, P., et al. (eds.) Proceedings of the 10th Joint Conference on Information Sciences (JCIS 2007), pp. 655\u2013661. World Scientific Publishing Co. Pte. Ltd., Singapore (2007)"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Coulom, R.: Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search. In: Ciancarini, P., van den Herik, H.J. (eds.) Proceedings of the 5th International Conference on Computers and Games, Turin, Italy (2006)","DOI":"10.1007\/978-3-540-75538-8_7"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Coulom, R.: Computing elo ratings of move patterns in the game of go. In: Computer Games Workshop, Amsterdam, The Netherlands (2007)","DOI":"10.3233\/ICG-2007-30403"},{"key":"32_CR5","first-page":"259","volume-title":"AAAI 2008: Proceedings of the 23rd National Conference on Artificial Intelligence","author":"H. Finnsson","year":"2008","unstructured":"Finnsson, H., Bj\u00f6rnsson, Y.: Simulation-based approach to general game playing. In: AAAI 2008: Proceedings of the 23rd National Conference on Artificial Intelligence, pp. 259\u2013264. AAAI Press, Menlo Park (2008)"},{"key":"32_CR6","first-page":"273","volume-title":"ICML 2007: Proceedings of the 24th International Conference on Machine Learning","author":"S. Gelly","year":"2007","unstructured":"Gelly, S., Silver, D.: Combining online and offline knowledge in UCT. In: ICML 2007: Proceedings of the 24th International Conference on Machine Learning, pp. 273\u2013280. ACM Press, New York (2007)"},{"key":"32_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/11871842_29","volume-title":"Machine Learning: ECML 2006","author":"L. Kocsis","year":"2006","unstructured":"Kocsis, L., Szepesv\u00e1ri, C.: Bandit based monte-carlo planning. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol.\u00a04212, pp. 282\u2013293. Springer, Heidelberg (2006)"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/0196-8858(85)90002-8","volume":"6","author":"T. Lai","year":"1985","unstructured":"Lai, T., Robbins, H.: Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics\u00a06, 4\u201322 (1985)","journal-title":"Advances in Applied Mathematics"},{"key":"32_CR9","unstructured":"Lee, C.-S., Wang, M.-H., Chaslot, G., Hoock, J.-B., Rimmel, A., Teytaud, O., Tsai, S.-R., Hsu, S.-C., Hong, T.-P.: The Computational Intelligence of MoGo Revealed in Taiwan\u2019s Computer Go Tournaments. IEEE Transactions on Computational Intelligence and AI in Games (2009)"},{"key":"32_CR10","unstructured":"Nakhost, H., M\u00fcller, M.: Monte-carlo exploration for deterministic planning. In: Boutilier, C. (ed.) IJCAI, pp. 1766\u20131771 (2009)"},{"key":"32_CR11","unstructured":"Rolet, P., Sebag, M., Teytaud, O.: Optimal active learning through billiards and upper confidence trees in continous domains. In: Proceedings of the ECML Conference (2009)"},{"key":"32_CR12","first-page":"8","volume-title":"Gecco 2009","author":"P. Rolet","year":"2009","unstructured":"Rolet, P., Sebag, M., Teytaud, O.: Optimal robust expensive optimization is tractable. In: Gecco 2009, p. 8. ACM, Montr\u00e9al (2009)"},{"key":"32_CR13","unstructured":"Wang, Y., Audibert, J.-Y., Munos, R.: Algorithms for infinitely many-armed bandits. In: Advances in Neural Information Processing Systems, vol.\u00a021 (2008)"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Wang, Y., Gelly, S.: Modifications of UCT and sequence-like simulations for Monte-Carlo Go. In: IEEE Symposium on Computational Intelligence and Games, Honolulu, Hawaii, pp. 175\u2013182 (2007)","DOI":"10.1109\/CIG.2007.368095"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25566-3_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T10:07:55Z","timestamp":1560938875000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25566-3_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255656","9783642255663"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25566-3_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}