{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T06:59:20Z","timestamp":1760079560048},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642213250"},{"type":"electronic","value":"9783642213267"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21326-7_32","type":"book-chapter","created":{"date-parts":[[2011,5,13]],"date-time":"2011-05-13T06:27:00Z","timestamp":1305268020000},"page":"295-304","source":"Crossref","is-referenced-by-count":22,"title":["A Hyperheuristic Approach for Dynamic Enumeration Strategy Selection in Constraint Satisfaction"],"prefix":"10.1007","author":[{"given":"Broderick","family":"Crawford","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Soto","sequence":"additional","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"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Bart\u00e1k, R., Rudov\u00e1, H.: Limited assignments: A new cutoff strategy for incomplete depth-first search. In: Proceedings of the 20th ACM Symposium on Applied Computing (SAC), pp. 388\u2013392 (2005)","key":"32_CR1","DOI":"10.1145\/1066677.1066767"},{"key":"32_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11402763_4","volume-title":"Recent Advances in Constraints","author":"J.C. Beck","year":"2005","unstructured":"Beck, J.C., Prosser, P., Wallace, R.J.: Trying again to fail-first. In: Faltings, B.V., Petcu, A., Fages, F., Rossi, F. (eds.) CSCLP 2004. LNCS (LNAI), vol.\u00a03419, pp. 41\u201355. Springer, Heidelberg (2005)"},{"key":"32_CR3","first-page":"146","volume-title":"Proceedings of the 16th Eureopean Conference on Artificial Intelligence (ECAI)","author":"F. Boussemart","year":"2004","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: Proceedings of the 16th Eureopean Conference on Artificial Intelligence (ECAI), pp. 146\u2013150. IOS Press, Amsterdam (2004)"},{"issue":"2","key":"32_CR4","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":"32_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/3-540-46135-3_35","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"S.L. Epstein","year":"2002","unstructured":"Epstein, S.L., Freuder, E.C., Wallace, R.J., Morozov, A., Samuels, B.: The adaptive constraint engine. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 525\u2013542. Springer, Heidelberg (2002)"},{"key":"32_CR6","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":"32_CR7","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":"32_CR8","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)"},{"issue":"1-3","key":"32_CR9","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.jalgor.2008.02.009","volume":"63","author":"R.J. Wallace","year":"2008","unstructured":"Wallace, R.J., Grimes, D.: Experimental studies of variable selection strategies based on constraint weights. J. Algorithms\u00a063(1-3), 114\u2013129 (2008)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","New Challenges on Bioinspired Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21326-7_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T07:35:30Z","timestamp":1558596930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21326-7_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642213250","9783642213267"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21326-7_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}