{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:11:27Z","timestamp":1767337887011,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031700545"},{"type":"electronic","value":"9783031700552"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-70055-2_6","type":"book-chapter","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T19:02:54Z","timestamp":1725649374000},"page":"85-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Learning a\u00a0Prior for\u00a0Monte Carlo Search by\u00a0Replaying Solutions to\u00a0Combinatorial Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4669-9374","authenticated-orcid":false,"given":"Tristan","family":"Cazenave","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,7]]},"reference":[{"issue":"3","key":"6_CR1","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1089\/cmb.2019.0420","volume":"27","author":"E Bonnet","year":"2020","unstructured":"Bonnet, E., Rz\u0105\u017cewski, P., Sikora, F.: Designing RNA secondary structures is hard. J. Comput. Biol. 27(3), 302\u2013316 (2020)","journal-title":"J. Comput. Biol."},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Bouzy, B.: Monte-Carlo fork search for cooperative path-finding. In: Computer Games Workshop at IJCAI, pp. 1\u201315 (2013)","DOI":"10.1007\/978-3-319-05428-5_1"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Bouzy, B.: Burnt pancake problem: New lower bounds on the diameter and new experimental optimality ratios. In: SOCS, pp. 119\u2013120 (2016)","DOI":"10.1609\/socs.v7i1.18398"},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCIAIG.2012.2186810","volume":"4","author":"C Browne","year":"2012","unstructured":"Browne, C., 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":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-12993-3_5","volume-title":"Advances in Computer Games","author":"T Cazenave","year":"2010","unstructured":"Cazenave, T.: Monte-Carlo Kakuro. In: van den Herik, H.J., Spronck, P. (eds.) ACG 2009. LNCS, vol. 6048, pp. 45\u201354. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12993-3_5"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Cazenave, T.: Nested Monte-Carlo search. In: Boutilier, C. (ed.) IJCAI, pp. 456\u2013461 (2009)","DOI":"10.1109\/IPDPS.2009.5161122"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Cazenave, T.: Generalized nested rollout policy adaptation. In: Monte Carlo Search at IJCAI (2020)","DOI":"10.1007\/978-3-030-89453-5"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Cazenave, T., Fournier, T.: Monte Carlo inverse folding. In: Monte Carlo Search at IJCAI (2020)","DOI":"10.1007\/978-3-030-89453-5"},{"issue":"1","key":"6_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.3233\/AIC-201577","volume":"34","author":"T Cazenave","year":"2021","unstructured":"Cazenave, T., Lucas, J.-Y., Triboulet, T., Kim, H.: Policy adaptation for vehicle routing. AI Commun. 34(1), 21\u201335 (2021)","journal-title":"AI Commun."},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Cazenave, T., Saffidine, A., Schofield, M., Thielscher, M.: Nested Monte Carlo search for two-player games. In: AAAI, pp. 687\u2013693 (2016)","DOI":"10.1609\/aaai.v30i1.10073"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Cazenave, T., Teytaud, F.: Application of the nested rollout policy adaptation algorithm to the traveling salesman problem with time windows. In: Learning and Intelligent Optimization - 6th International Conference, LION 6, pp. 42\u201354 (2012)","DOI":"10.1007\/978-3-642-34413-8_4"},{"issue":"1","key":"6_CR12","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0166-218X(84)90075-1","volume":"8","author":"CJ Colbourn","year":"1984","unstructured":"Colbourn, C.J.: The complexity of completing partial latin squares. Discret. Appl. Math. 8(1), 25\u201330 (1984)","journal-title":"Discret. Appl. Math."},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Edelkamp, S., Gath, M., Cazenave, T., Teytaud, F.: Algorithm and knowledge engineering for the TSPTW problem. In: 2013 IEEE Symposium on Computational Intelligence in Scheduling (SCIS), pp. 44\u201351. IEEE (2013)","DOI":"10.1109\/SCIS.2013.6613251"},{"key":"6_CR14","series-title":"Lecture Notes in Logistics","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-319-21266-1_28","volume-title":"Commercial Transport","author":"S Edelkamp","year":"2016","unstructured":"Edelkamp, S., Gath, M., Greulich, C., Humann, M., Herzog, O., Lawo, M.: Monte-Carlo Tree search for logistics. In: Clausen, U., Friedrich, H., Thaller, C., Geiger, C. (eds.) Commercial Transport. LNL, pp. 427\u2013440. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-21266-1_28"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-319-11206-0_28","volume-title":"KI 2014: Advances in Artificial Intelligence","author":"S Edelkamp","year":"2014","unstructured":"Edelkamp, S., Gath, M., Rohde, M.: Monte-Carlo tree search for 3D packing with object orientation. In: Lutz, C., Thielscher, M. (eds.) KI 2014. LNCS (LNAI), vol. 8736, pp. 285\u2013296. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11206-0_28"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Edelkamp, S., Greulich, C.: Solving physical traveling salesman problems with policy adaptation. In: 2014 IEEE Conference on Computational Intelligence and Games (CIG), pp. 1\u20138. IEEE (2014)","DOI":"10.1109\/CIG.2014.6932882"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Edelkamp, S., Tang, Z.: Monte-Carlo tree search for the multiple sequence alignment problem. In: Proceedings of the Eighth Annual Symposium on Combinatorial Search, SOCS 2015, pp. 9\u201317. AAAI Press (2015)","DOI":"10.1609\/socs.v6i1.18359"},{"key":"6_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2022.109204","volume":"216","author":"M Elkael","year":"2022","unstructured":"Elkael, M., Aba, M.A., Araldo, A., Castel-Taleb, H., Jouaber, B.: Monkey business: reinforcement learning meets neighborhood search for virtual network embedding. Comput. Netw. 216, 109204 (2022)","journal-title":"Comput. Netw."},{"key":"6_CR19","unstructured":"Finnsson, H., Bj\u00f6rnsson, Y.: Simulation-based approach to general game playing. In: AAAI, vol. 8, pp. 259\u2013264 (2008)"},{"issue":"6","key":"6_CR20","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1109\/TEVC.2019.2899053","volume":"23","author":"Y Jin","year":"2019","unstructured":"Jin, Y., Hao, J.-K.: Solving the latin square completion problem by memetic graph coloring. IEEE Trans. Evol. Comput. 23(6), 1015\u20131028 (2019)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"D1","key":"6_CR21","doi-asserted-by":"publisher","first-page":"D192","DOI":"10.1093\/nar\/gkaa1047","volume":"49","author":"I Kalvari","year":"2021","unstructured":"Kalvari, I., et al.: Rfam 14: expanded coverage of metagenomic, viral and microRNA families. Nucleic Acids Res. 49(D1), D192\u2013D200 (2021)","journal-title":"Nucleic Acids Res."},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Lorenz, R., et al.: Viennarna package 2.0. Algorithms Mol. Biol. 6, 1\u201314 (2011)","DOI":"10.1186\/1748-7188-6-26"},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.virol.2017.11.025","volume":"517","author":"R Madhugiri","year":"2018","unstructured":"Madhugiri, R., et al.: Structural and functional conservation of cis-acting RNA elements in coronavirus 5\u2019-terminal genome regions. Virology 517, 44\u201355 (2018)","journal-title":"Virology"},{"issue":"4","key":"6_CR24","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":"6_CR25","doi-asserted-by":"crossref","unstructured":"Portela, F.: An unexpectedly effective Monte Carlo technique for the RNA inverse folding problem. BioRxiv, p. 345587 (2018)","DOI":"10.1101\/345587"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"Poulding, S.M., Feldt, R.: Generating structured test data with specific properties using nested Monte-Carlo search. In: GECCO, pp. 1279\u20131286 (2014)","DOI":"10.1145\/2576768.2598339"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Poulding, S.M., Feldt, R.: Heuristic model checking using a Monte-Carlo tree search algorithm. In: GECCO, pp. 1359\u20131366 (2015)","DOI":"10.1145\/2739480.2754767"},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-642-20520-0_51","volume-title":"Applications of Evolutionary Computation","author":"A Rimmel","year":"2011","unstructured":"Rimmel, A., Teytaud, F., Cazenave, T.: Optimization of the nested Monte-Carlo algorithm on the traveling salesman problem with time windows. In: Di Chio, C., et al. (eds.) EvoApplications 2011. LNCS, vol. 6625, pp. 501\u2013510. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20520-0_51"},{"key":"6_CR29","unstructured":"Rosin, C.D.: Nested rollout policy adaptation for Monte Carlo tree search. In: IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pp. 649\u2013654 (2011)"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Roucairol, M., Cazenave, T.: Comparing search algorithms on the retrosynthesis problem. In: AI to Accelerate Science and Engineering at AAAI 2023 (2023)","DOI":"10.1002\/minf.202300259"},{"key":"6_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-642-13122-6_31","volume-title":"Fun with Algorithms","author":"O Ruepp","year":"2010","unstructured":"Ruepp, O., Holzer, M.: The computational complexity of the Kakuro puzzle, revisited. In: Boldi, P., Gargano, L. (eds.) FUN 2010. LNCS, vol. 6099, pp. 319\u2013330. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13122-6_31"},{"key":"6_CR32","unstructured":"Silver, D., et al.: Mastering chess and shogi by self-play with a general reinforcement learning algorithm. CoRR, abs\/1712.01815 (2017)"},{"key":"6_CR33","unstructured":"Simonis, H.: Kakuro as a constraint problem. In: Proceedings of Seventh International Workshop on Constraint Modelling and Reformulation (2008)"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVIII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-70055-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T19:03:38Z","timestamp":1725649418000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-70055-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031700545","9783031700552"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-70055-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hagenberg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2024.fh-ooe.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}