{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:59:37Z","timestamp":1743098377230,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642315183"},{"type":"electronic","value":"9783642315190"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-642-31519-0_11","type":"book-chapter","created":{"date-parts":[[2012,8,13]],"date-time":"2012-08-13T14:30:13Z","timestamp":1344868213000},"page":"171-188","source":"Crossref","is-referenced-by-count":4,"title":["A Hyperheuristic Approach for Guiding Enumeration in Constraint Solving"],"prefix":"10.1007","author":[{"given":"Broderick","family":"Crawford","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Castro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Monfroy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Soto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenceslao","family":"Palma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando","family":"Paredes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Bart\u00e1k, R., Rudov\u00e1, H.: Limited assignments: A new cutoff strategy for incomplete depth-firstsearch. In: Haddad, H., Liebrock, L.M., Omicini, A., Wainwright, R.L. (eds.) SAC, pp. 388\u2013392. ACM (2005)","DOI":"10.1145\/1066677.1066767"},{"key":"11_CR2","unstructured":"Beck, J.C., Prosser, P., Wallace, R.J.: Toward understanding variable ordering heuristics for constraint satisfaction problems. In: Fourteenth Irish Artificial Intelligence and Cognitive Science Conference (AICS), pp. 11\u201316 (2003)"},{"key":"11_CR3","unstructured":"Bessi\u00e8re, C., Zanuttini, B., Fernandez, C.: Measuring search trees. In: Proceedings ECAI 2004 Workshop on Modelling and Solving Problems with Constraints, pp. 31\u201340. IOS Press (2004)"},{"key":"11_CR4","first-page":"160","volume-title":"ECAI","author":"J.E. Borrett","year":"1996","unstructured":"Borrett, J.E., Tsang, E.P.K., Walsh, N.R.: Adaptive constraint satisfaction: The quickest first principle. In: Wahlster, W. (ed.) ECAI, pp. 160\u2013164. John Wiley and Sons, Chichester (1996)"},{"key":"11_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/11579427_17","volume-title":"MICAI 2005: Advances in Artificial Intelligence","author":"C. Castro","year":"2005","unstructured":"Castro, C., Monfroy, E., Figueroa, C., Meneses, R.: An Approach for Dynamic Split Strategies in Constraint Solving. In: Gelbukh, A., de Albornoz, \u00c1., Terashima-Mar\u00edn, H. (eds.) MICAI 2005. LNCS (LNAI), vol.\u00a03789, pp. 162\u2013174. Springer, Heidelberg (2005)"},{"issue":"2","key":"11_CR6","first-page":"175","volume":"23","author":"R. Chenouard","year":"2009","unstructured":"Chenouard, R., Granvilliers, L., Sebastian, P.: Search heuristics for constraint-aided embodiment design. AI EDAM\u00a023(2), 175\u2013195 (2009)","journal-title":"AI EDAM"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/3-540-44629-X_11","volume-title":"Practice and Theory of Automated Timetabling III","author":"P.I. Cowling","year":"2001","unstructured":"Cowling, P.I., Kendall, G., Soubeiga, E.: A Hyperheuristic Approach to Scheduling a Sales Summit. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol.\u00a02079, pp. 176\u2013190. Springer, Heidelberg (2001)"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Crawford, B., Castro, C., Monfroy, E.: Using a choice function for guiding enumeration in constraint solving. In: 9th Mexican International Conference on Artificial Intelligence, MICAI 2010, Pachuca, Mexico, November 8-13, Special Sessions, Revised Papers, pp. 37\u201342 (2010)","DOI":"10.1109\/MICAI.2010.23"},{"key":"11_CR9","unstructured":"Hamadi, Y., Monfroy, E., Saubion, F.: What is autonomous search? Technical Report MSR-TR-2008-80, Microsoft Research (2008)"},{"issue":"1","key":"11_CR10","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0004-3702(94)90064-7","volume":"71","author":"R.J. Bayardo Jr.","year":"1994","unstructured":"Bayardo Jr., R.J., Miranker, D.P.: An optimal backtrack algorithm for tree-structured constraint satisfaction problems. Artif. Intell.\u00a071(1), 159\u2013181 (1994)","journal-title":"Artif. Intell."},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0004-3702(85)90041-4","volume":"25","author":"A.K. Mackworth","year":"1985","unstructured":"Mackworth, A.K., Freuder, E.C.: The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artif. Intell.\u00a025(1), 65\u201374 (1985)","journal-title":"Artif. Intell."},{"issue":"1","key":"11_CR12","first-page":"39","volume":"4","author":"J. Maturana","year":"2008","unstructured":"Maturana, J., Saubion, F.: From parameter control to search control: Parameter control abstraction in evolutionary algorithms. Constraint Programming Letters\u00a04(1), 39\u201365 (2008)","journal-title":"Constraint Programming Letters"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/11890393_37","volume-title":"Advances in Information Systems","author":"E. Monfroy","year":"2006","unstructured":"Monfroy, E., Castro, C., Crawford, B.: Adaptive Enumeration Strategies and Metabacktracks for Constraint Solving. In: Yakhno, T., Neuhold, E.J. (eds.) ADVIS 2006. LNCS, vol.\u00a04243, pp. 354\u2013363. Springer, Heidelberg (2006)"},{"issue":"1","key":"11_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(95)00098-4","volume":"86","author":"N.M. Sadeh","year":"1996","unstructured":"Sadeh, N.M., Fox, M.S.: Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem. Artif. Intell.\u00a086(1), 1\u201341 (1996)","journal-title":"Artif. Intell."},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1007\/978-3-540-45193-8_121","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"P. Sturdy","year":"2003","unstructured":"Sturdy, P.: Learning Good Variable Orderings. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, p. 997. Springer, Heidelberg (2003)"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Talbi, E.G.: Metaheuristics: From Design to Implementation. Wiley Publishing (2009)","DOI":"10.1002\/9780470496916"}],"container-title":["Advances in Intelligent Systems and Computing","EVOLVE - A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31519-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T09:21:40Z","timestamp":1675934500000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-31519-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642315183","9783642315190"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31519-0_11","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2013]]}}}