{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T17:26:39Z","timestamp":1725989199463},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030001100"},{"type":"electronic","value":"9783030001117"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00111-7_27","type":"book-chapter","created":{"date-parts":[[2018,8,30]],"date-time":"2018-08-30T00:32:07Z","timestamp":1535589127000},"page":"315-326","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Variant of Monte-Carlo Tree Search for Referring Expression Generation"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Schwartz","sequence":"first","affiliation":[]},{"given":"Diedrich","family":"Wolter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,30]]},"reference":[{"issue":"2","key":"27_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. Mach. Learn. 47(2), 235\u2013256 (2002)","journal-title":"Mach. Learn."},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-540-87601-4_17","volume-title":"Spatial Cognition VI. Learning, Reasoning, and Talking about Space","author":"M Barclay","year":"2008","unstructured":"Barclay, M., Galton, A.: An influence model for reference object selection in spatially locative phrases. In: Freksa, C., Newcombe, N.S., G\u00e4rdenfors, P., W\u00f6lfl, S. (eds.) Spatial Cognition 2008. LNCS (LNAI), vol. 5248, pp. 216\u2013232. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87601-4_17"},{"issue":"1","key":"27_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCIAIG.2012.2186810","volume":"4","author":"CB Browne","year":"2012","unstructured":"Browne, C.B., et al.: A survey of Monte Carlo tree search methods. IEEE Trans. Comput. Intell. AI Games 4(1), 1\u201343 (2012)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Cazenave, T.: Nested Monte-Carlo search. In: Proceedings of the 21st International Joint Conference on Artifical Intelligence (IJCAI), pp. 456\u2013461. Morgan Kaufmann Publishers Inc. (2009)","DOI":"10.1109\/IPDPS.2009.5161122"},{"key":"27_CR5","unstructured":"Chaslot, G.B.: Monte-Carlo Tree Search. Ph.D. thesis, Maastricht University (2010)"},{"key":"27_CR6","unstructured":"Chaslot, G.B., Hoock, J.B., Perez, J., Rimmel, A., Teytaud, O., Winands, M.: Meta Monte-Carlo Tree Search for automatic opening book generation. In: Proceedings of the IJCAI 2009 Workshop on General Intelligence in Game Playing Agents, Pasadena, CA, USA, pp. 7\u201312 (2009)"},{"key":"27_CR7","unstructured":"Chaslot, G.B., Saito, J.T., Bouzy, B., Uiterwijk, J., van den Herik, H.J.: Monte-Carlo strategies for computer Go. In: Proceedings of the 18th BeNeLux Conference on Artificial Intelligence, Namur, Belgium, pp. 83\u201391 (2006)"},{"key":"27_CR8","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. 4630, pp. 72\u201383. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75538-8_7"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Dale, R.: Cooking up referring expressions. In: Proceedings of the 27th Annual Meeting on Association for Computational Linguistics, pp. 68\u201375. Association for Computational Linguistics (1989)","DOI":"10.3115\/981623.981632"},{"key":"27_CR10","volume-title":"Generating Referring Expressions: Building Descriptions in a Domain of Objects and Processes","author":"R Dale","year":"1992","unstructured":"Dale, R.: Generating Referring Expressions: Building Descriptions in a Domain of Objects and Processes. MIT Press, Cambridge (1992)"},{"issue":"2","key":"27_CR11","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1207\/s15516709cog1902_3","volume":"19","author":"R Dale","year":"1995","unstructured":"Dale, R., Reiter, E.: Computational interpretations of the Gricean maxims in the generation of referring expressions. Cogn. Sci. 19(2), 233\u2013263 (1995)","journal-title":"Cogn. Sci."},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science (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. 4212, pp. 282\u2013293. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11871842_29"},{"key":"27_CR13","unstructured":"Kocsis, L., Szepesv\u00e1ri, C., Willemson, J.: Improved Monte-Carlo search. Technical report, University of Tartu, Institute of Computer Science, Tartu, Estonia (2006)"},{"issue":"1","key":"27_CR14","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/COLI_a_00088","volume":"38","author":"E Krahmer","year":"2012","unstructured":"Krahmer, E., van Deemter, K.: Computational generation of referring expressions: a survey. Comput. Linguist. 38(1), 173\u2013218 (2012)","journal-title":"Comput. Linguist."},{"key":"27_CR15","unstructured":"Mast, V.: Referring expression generation in situated interaction. Ph.D. thesis, Universit\u00e4t Bremen (2016)"},{"issue":"5","key":"27_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/0952813X.2016.1154611","volume":"28","author":"V Mast","year":"2016","unstructured":"Mast, V., Falomir, Z., Wolter, D.: Probabilistic reference and grounding with PRAGR for dialogues with robots. J. Exp. Theor. Artif. Intell. 28(5), 1\u201323 (2016)","journal-title":"J. Exp. Theor. Artif. Intell."},{"issue":"4","key":"27_CR17","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1109\/TCIAIG.2010.2088123","volume":"2","author":"J M\u00e9hat","year":"2010","unstructured":"M\u00e9hat, J., Cazenave, T.: Combining uct and nested Monte Carlo search for single-player general game playing. IEEE Trans. Comput. Intell. AI Games 2(4), 271\u2013277 (2010)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"27_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-87608-3_1","volume-title":"Computers and Games","author":"MPD Schadd","year":"2008","unstructured":"Schadd, M.P.D., Winands, M.H.M., van den Herik, H.J., Chaslot, G.M.J.-B., Uiterwijk, J.W.H.M.: Single-player Monte-Carlo Tree Search. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol. 5131, pp. 1\u201312. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87608-3_1"},{"key":"27_CR19","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1111\/j.1551-6709.2011.01205.x","volume":"36","author":"K Deemter Van","year":"2012","unstructured":"Van Deemter, K., Gatt, A., van der Sluis, I., Power, R.: Generation of referring expressions: assessing the incremental algorithm. Cogn. Sci. 36, 799\u2013836 (2012)","journal-title":"Cogn. Sci."}],"container-title":["Lecture Notes in Computer Science","KI 2018: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00111-7_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,23]],"date-time":"2019-10-23T02:07:55Z","timestamp":1571796475000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00111-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030001100","9783030001117"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00111-7_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}