{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T05:57:03Z","timestamp":1763704623155},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121470"},{"type":"electronic","value":"9783642121487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12148-7_23","type":"book-chapter","created":{"date-parts":[[2010,3,31]],"date-time":"2010-03-31T11:19:10Z","timestamp":1270034350000},"page":"268-277","source":"Crossref","is-referenced-by-count":5,"title":["Bandit-Based Genetic Programming"],"prefix":"10.1007","author":[{"given":"Jean-Baptiste","family":"Hoock","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Teytaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Audibert, J.-Y., Munos, R., Szepesvari, C.: Use of variance estimation in the multi-armed bandit problem. In: NIPS 2006 Workshop on On-line Trading of Exploration and Exploitation (2006)"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Audouard, P., Chaslot, G., Hoock, J.-B., Perez, J., Rimmel, A., Teytaud, O.: Grid coevolution for adaptive simulations; application to the building of opening books in the game of go. In: Proceedings of EvoGames (2009)","DOI":"10.1007\/978-3-642-01129-0_36"},{"issue":"2\/3","key":"23_CR3","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":"23_CR4","doi-asserted-by":"crossref","unstructured":"Auger, A., Teytaud, O.: Continuous lunches are free plus the design of optimal optimization algorithms. Algorithmica (2009)","DOI":"10.1007\/s00453-008-9244-5"},{"key":"23_CR5","unstructured":"Bruegmann, B.: Monte carlo go (1993)"},{"key":"23_CR6","unstructured":"Cazenave, T., Jouandeau, N.: On the parallelization of UCT. In: Proceedings of CGW 2007, pp. 93\u2013101 (2007)"},{"key":"23_CR7","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":"23_CR8","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":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-540-87608-3_6","volume-title":"Computers and Games","author":"G. Chaslot","year":"2008","unstructured":"Chaslot, G., Winands, M., van den Herik, H.: Parallel Monte-Carlo Tree Search. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol.\u00a05131, pp. 60\u201371. Springer, Heidelberg (2008)"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-75538-8_7","volume-title":"Computers and Games","author":"R. Coulom","year":"2007","unstructured":"Coulom, R.: Efficient selectivity and backup operators in monte-carlo tree search. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M(J.) (eds.) CG 2006. LNCS, vol.\u00a04630, pp. 72\u201383. Springer, Heidelberg (2007)"},{"key":"23_CR11","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":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-48957-6_15","volume-title":"Computers and Games","author":"M. Crasmaru","year":"1999","unstructured":"Crasmaru, M.: On the complexity of Tsume-Go. In: van den Herik, H.J., Iida, H. (eds.) CG 1998. LNCS, vol.\u00a01558, pp. 222\u2013231. Springer, Heidelberg (1999)"},{"key":"23_CR13","unstructured":"Gelly, S., Hoock, J.B., Rimmel, A., Teytaud, O., Kalemkarian, Y.: The parallelization of monte-carlo planning. In: Proceedings of the International Conference on Informatics in Control, Automation and Robotics ICINCO 2008, pp. 198\u2013203 (2008) (To appear)"},{"key":"23_CR14","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)"},{"issue":"2","key":"23_CR15","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1137\/0202009","volume":"2","author":"J.H. Holland","year":"1973","unstructured":"Holland, J.H.: Genetic algorithms and the optimal allocation of trials. SIAM J. Comput.\u00a02(2), 88\u2013105 (1973)","journal-title":"SIAM J. Comput."},{"key":"23_CR16","unstructured":"Kato, H., Takeuchi, I.: Parallel monte-carlo tree search with simulation servers. In: 13th Game Programming Workshop (GPW 2008) (November 2008)"},{"key":"23_CR17","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":"23_CR18","volume-title":"Genetic Programming: On the Programming of Computers by means of Natural Evolution","author":"J.R. Koza","year":"1992","unstructured":"Koza, J.R.: Genetic Programming: On the Programming of Computers by means of Natural Evolution. MIT Press, Massachusetts (1992)"},{"key":"23_CR19","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":"23_CR20","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)"},{"issue":"2","key":"23_CR21","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1145\/322186.322201","volume":"27","author":"D. Lichtenstein","year":"1980","unstructured":"Lichtenstein, D., Sipser, M.: Go is polynomial-space hard. J. ACM\u00a027(2), 393\u2013401 (1980)","journal-title":"J. ACM"},{"key":"23_CR22","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/1390156.1390241","volume-title":"ICML 2008: Proceedings of the 25th international conference on Machine learning","author":"V. Mnih","year":"2008","unstructured":"Mnih, V., Szepesv\u00e1ri, C., Audibert, J.-Y.: Empirical Bernstein stopping. In: ICML 2008: Proceedings of the 25th international conference on Machine learning, pp. 672\u2013679. ACM, New York (2008)"},{"key":"23_CR23","unstructured":"Robson, J.M.: The complexity of go. In: IFIP Congress, pp. 413\u2013417 (1983)"},{"key":"23_CR24","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":"23_CR25","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","Genetic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12148-7_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:50:08Z","timestamp":1606168208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12148-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121470","9783642121487"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12148-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}