{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T15:42:08Z","timestamp":1759938128934},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137990"},{"type":"electronic","value":"9783642138003"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13800-3_9","type":"book-chapter","created":{"date-parts":[[2010,6,18]],"date-time":"2010-06-18T06:35:53Z","timestamp":1276842953000},"page":"111-124","source":"Crossref","is-referenced-by-count":6,"title":["Consistency Modifications for Automatically Tuned Monte-Carlo Tree Search"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Berthier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hassen","family":"Doghmen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Teytaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2\/3","key":"9_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P. Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite time analysis of the multiarmed bandit problem. Machine Learning\u00a047(2\/3), 235\u2013256 (2002)","journal-title":"Machine Learning"},{"key":"9_CR2","volume-title":"Dynamic Programming","author":"R. Bellman","year":"1957","unstructured":"Bellman, R.: Dynamic Programming. Princeton Univ. Press, Princeton (1957)"},{"unstructured":"Chaslot, G., Hoock, J.-B., Teytaud, F., Teytaud, O.: On the huge benefit of quasi-random mutations for multimodal optimization with application to grid-based tuning of neurocontrollers. In: ESANN, Bruges, Belgium (2009)","key":"9_CR3"},{"unstructured":"Chaslot, G., Saito, J.-T., Bouzy, B., Uiterwijk, J.W.H.M., van den Herik, H.J.: Monte-Carlo Strategies for Computer Go. In: Schobbens, P.-Y., Vanhoof, W., Schwanen, G. (eds.) Proceedings of the 18th BeNeLux Conference on Artificial Intelligence, Namur, Belgium, pp. 83\u201391 (2006)","key":"9_CR4"},{"key":"9_CR5","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)"},{"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)","key":"9_CR6","DOI":"10.1007\/978-3-540-75538-8_7"},{"doi-asserted-by":"crossref","unstructured":"De Mesmay, F., Rimmel, A., Voronenko, Y., P\u00fcschel, M.: Bandit-Based Optimization on Graphs with Application to Library Performance Tuning. In: ICML, Montr\u00e9al, Canada (2009)","key":"9_CR7","DOI":"10.1145\/1553374.1553468"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/1273496.1273531","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":"9_CR9","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., Szepesvari, 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":"9_CR10","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"},{"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":"9_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":"9_CR12"},{"doi-asserted-by":"crossref","unstructured":"Rolet, P., Sebag, M., Teytaud, O.: Optimal robust expensive optimization is tractable. In: Gecco 2009, Montr??al Canada, 8 p. ACM, New York (2009);","key":"#cr-split#-9_CR13.1","DOI":"10.1145\/1569901.1570255"},{"unstructured":"G.: Mathematics of Computing\/G.1: NUMERICAL ANALYSIS\/G.1.6: Optimization, I.: Computing Methodologies\/I.2: ARTIFICIAL INTELLIGENCE\/I.2.8: Problem Solving, Control Methods, and Search","key":"#cr-split#-9_CR13.2"},{"doi-asserted-by":"crossref","unstructured":"Teytaud, F., Teytaud, O.: Creating an Upper-Confidence-Tree program for Havannah. In: ACG 12, Pamplona, Espagne (2009)","key":"9_CR14","DOI":"10.1007\/978-3-642-12993-3_7"},{"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":"9_CR15"},{"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)","key":"9_CR16","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-13800-3_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:43:49Z","timestamp":1606185829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13800-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137990","9783642138003"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13800-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}