{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T05:10:01Z","timestamp":1746335401878,"version":"3.40.4"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319104270"},{"type":"electronic","value":"9783319104287"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10428-7_16","type":"book-chapter","created":{"date-parts":[[2014,8,13]],"date-time":"2014-08-13T01:33:54Z","timestamp":1407893634000},"page":"190-206","source":"Crossref","is-referenced-by-count":0,"title":["Experimental Comparison of BTD and Intelligent Backtracking: Towards an Automatic Per-instance Algorithm Selector"],"prefix":"10.1007","author":[{"given":"Lo\u00efc","family":"Blet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samba Ndojh","family":"Ndiaye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christine","family":"Solnon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","volume-title":"Handbook of Constraint Programming (Foundations of Artificial Intelligence)","author":"F. Rossi","year":"2006","unstructured":"Rossi, F., van Beek, P., Walsh, T.: Handbook of Constraint Programming (Foundations of Artificial Intelligence). Elsevier Science Inc., New York (2006)"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1111\/j.1467-8640.1993.tb00310.x","volume":"9","author":"P. Prosser","year":"1993","unstructured":"Prosser, P.: Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence\u00a09, 268\u2013299 (1993)","journal-title":"Computational Intelligence"},{"key":"16_CR3","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1613\/jair.1","volume":"1","author":"M. Ginsberg","year":"1993","unstructured":"Ginsberg, M.: Dynamic backtracking. Journal of Artificial Intelligence Research\u00a01, 25\u201346 (1993)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"1","key":"16_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0004-3702(02)00221-7","volume":"139","author":"N. Jussien","year":"2002","unstructured":"Jussien, N., Lhomme, O.: Local search with constraint propagation and conflict-based heuristics. Artif. Intell.\u00a0139(1), 21\u201345 (2002)","journal-title":"Artif. Intell."},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0004-3702(02)00400-9","volume":"146","author":"P. J\u00e9gou","year":"2003","unstructured":"J\u00e9gou, P., Terrioux, C.: Hybrid backtracking bounded by tree-decomposition of constraint networks. Artif. Intell.\u00a0146, 43\u201375 (2003)","journal-title":"Artif. Intell."},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Lecoutre, C., Boussemart, F., Hemery, F.: Backjump-based techniques versus conflict-directed heuristics. In: 16th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2004, pp. 549\u2013557. IEEE (2004)","DOI":"10.1109\/ICTAI.2004.37"},{"key":"16_CR7","first-page":"146","volume":"16","author":"F. Boussemart","year":"2004","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. ECAI\u00a016, 146 (2004)","journal-title":"ECAI"},{"key":"16_CR8","unstructured":"Blet, L., Ndiaye, S.N., Solnon, C.: A generic framework for solving csps integrating decomposition methods. In: CP Doctoral Program, Quebec, Canada (2012)"},{"key":"16_CR9","unstructured":"O\u2019Mahony, E., Hebrard, E., Holland, A., Nugent, C., O\u2019Sullivan, B.: Using case-based reasoning in an algorithm portfolio for constraint solving. In: Irish Conference on Artificial Intelligence and Cognitive Science (2008)"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Xu, L., Hoos, H., Leyton-Brown, K.: Hydra: Automatically configuring algorithms for portfolio-based selection. In: AAAI, vol.\u00a010, pp. 210\u2013216 (2010)","DOI":"10.1609\/aaai.v24i1.7565"},{"key":"16_CR11","unstructured":"Kadioglu, S., Malitsky, Y., Sellmann, M., Tierney, K.: Isac-instance-specific algorithm configuration. In: ECAI, vol.\u00a0215, pp. 751\u2013756 (2010)"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-642-38171-3_21","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"R. Amadini","year":"2013","unstructured":"Amadini, R., Gabbrielli, M., Mauro, J.: An empirical evaluation of portfolios approaches for solving CSPs. In: Gomes, C., Sellmann, M. (eds.) CPAIOR 2013. LNCS, vol.\u00a07874, pp. 316\u2013324. Springer, Heidelberg (2013)"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Geschwender, D.J., Karakashian, S., Woodward, R.J., Choueiry, B.Y., Scott, S.D.: Selecting the appropriate consistency algorithm for csps using machine learning classifiers. In: Twenty-Seventh AAAI Conference on Artificial Intelligence (2013)","DOI":"10.1609\/aaai.v27i1.8532"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/3-540-45349-0_5","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"F. Bacchus","year":"2000","unstructured":"Bacchus, F.: Extending forward checking. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 35\u201351. Springer, Heidelberg (2000)"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/3-540-45349-0_19","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"N. Jussien","year":"2000","unstructured":"Jussien, N., Debruyne, R., Boizumault, P.: Maintaining arc-consistency within dynamic backtracking. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 249\u2013261. Springer, Heidelberg (2000)"},{"key":"16_CR16","unstructured":"Baker, A.B.: The hazards of fancy backtracking. In: AAAI, pp. 288\u2013293 (1994)"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Zivan, R., Shapen, U., Zazone, M., Meisels, A.: Retroactive ordering for dynamic backtracking. In: CP, pp. 766\u2013771 (2006)","DOI":"10.1007\/11889205_67"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-540-24664-0_17","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"C. Pralet","year":"2004","unstructured":"Pralet, C., Verfaillie, G.: Travelling in the world of local searches in the space of partial assignments. In: R\u00e9gin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol.\u00a03011, pp. 240\u2013255. Springer, Heidelberg (2004)"},{"key":"16_CR19","unstructured":"Kjaerulff, U.: Triangulation of graphs: Algorithms giving small total state space. Technical report, University of Aalborg (1990)"},{"issue":"1","key":"16_CR20","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A.K. Mackworth","year":"1977","unstructured":"Mackworth, A.K.: Consistency in networks of relations. Artificial intelligence\u00a08(1), 99\u2013118 (1977)","journal-title":"Artificial intelligence"},{"key":"16_CR21","unstructured":"Bessi\u00e8re, C., R\u00e9gin, J.-C.: Refining the basic constraint propagation algorithm. In: IJCAI, vol.\u00a01, pp. 309\u2013315 (2001)"},{"key":"16_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-61551-2_66","volume-title":"Principles and Practice of Constraint Programming - CP\u201996","author":"C. Bessiere","year":"1996","unstructured":"Bessiere, C., R\u00e9gin, J.-C.: Mac and combined heuristics: Two reasons to forsake fc (and cbj?) on hard problems. In: Freuder, E.C. (ed.) CP 1996. LNCS, vol.\u00a01118, pp. 61\u201375. Springer, Heidelberg (1996)"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"J\u00e9gou, P., Ndiaye, S., Terrioux, C.: Dynamic heuristics for backtrack search on tree-decomposition of CSPs. In: IJCAI, pp. 112\u2013117 (2007)","DOI":"10.1002\/9780470612309.ch20"},{"key":"16_CR24","unstructured":"J\u00e9gou, P., Ndiaye, S.N., Terrioux, C.: Strategies and Heuristics for Exploiting Tree-decompositions of Constraint Networks. In: Inference methods based on graphical structures of knowledge (WIGSK 2006), ECAI Workshop, pp. 13\u201318 (2006)"},{"key":"16_CR25","unstructured":"Morara, M., Mauro, J., Gabbrielli, M.: Solving xcsp problems by using gecode. In: 26th Italian Conference on Computational Logic (CILC). CEUR Workshop Proceedings, vol.\u00a0810, pp. 401\u2013405. CEUR-WS.org (2011)"},{"key":"16_CR26","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1613\/jair.788","volume":"14","author":"X. Chen","year":"2001","unstructured":"Chen, X., Beek, P.v.: Conflict-directed backjumping revisited. Journal of Artificial Intelligence Research\u00a014, 53\u201381 (2001)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Malitsky, Y., Mehta, D., O\u2019Sullivan, B.: Evolving instance specific algorithm configuration. In: Symposium on Combinatorial Search, SOCS (2013)","DOI":"10.1007\/978-3-319-11230-5_9"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Battiti, R., Brunato, M.: The LION Way: Machine Learning plus Intelligent Optimization. Lionsolver Inc. (2013)","DOI":"10.14778\/2536222.2536247"},{"key":"16_CR29","unstructured":"Holmes, G., Donkin, A., Witten, I.H.: Weka: A machine learning workbench. In: Proceedings of the 1994 Second Australian and New Zealand Conference on Intelligent Information Systems, pp. 357\u2013361. IEEE (1994)"},{"issue":"1","key":"16_CR30","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1656274.1656278","volume":"11","author":"M. Hall","year":"2009","unstructured":"Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., Witten, I.H.: The weka data mining software: an update. ACM SIGKDD Explorations Newsletter\u00a011(1), 10\u201318 (2009)","journal-title":"ACM SIGKDD Explorations Newsletter"},{"issue":"1","key":"16_CR31","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1007421302149","volume":"32","author":"E. Frank","year":"1998","unstructured":"Frank, E., Wang, Y., Inglis, S., Holmes, G., Witten, I.H.: Using model trees for classification. Machine Learning\u00a032(1), 63\u201376 (1998)","journal-title":"Machine Learning"},{"key":"16_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/978-3-642-23786-7_36","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"S. Kadioglu","year":"2011","unstructured":"Kadioglu, S., O\u2019Mahony, E., Refalo, P., Sellmann, M.: Incorporating variance in impact-based search. In: Lee, J. (ed.) CP 2011. LNCS, vol.\u00a06876, pp. 470\u2013477. Springer, Heidelberg (2011)"},{"key":"16_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/3-540-61551-2_73","volume-title":"Principles and Practice of Constraint Programming - CP\u201996","author":"H.E. Sakkout","year":"1996","unstructured":"Sakkout, H.E., Wallace, M.G., Richards, E.B.: An instance of adaptive constraint propagation. In: Freuder, E.C. (ed.) CP 1996. LNCS, vol.\u00a01118, pp. 164\u2013178. Springer, Heidelberg (1996)"},{"key":"16_CR34","unstructured":"Liberto, G.D., Kadioglu, S., Leo, K., Malitsky, Y.: Dash: Dynamic approach for switching heuristics. CoRR, abs\/1307.4689 (2013)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10428-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:55:08Z","timestamp":1746334508000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-10428-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319104270","9783319104287"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10428-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}