{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T17:03:00Z","timestamp":1725901380744},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642311369"},{"type":"electronic","value":"9783642311376"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31137-6_46","type":"book-chapter","created":{"date-parts":[[2012,6,18]],"date-time":"2012-06-18T09:17:55Z","timestamp":1340011075000},"page":"607-617","source":"Crossref","is-referenced-by-count":26,"title":["Using Autonomous Search for Generating Good Enumeration Strategy Blends in Constraint Programming"],"prefix":"10.1007","author":[{"given":"Ricardo","family":"Soto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Broderick","family":"Crawford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Monfroy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V\u00edctor","family":"Bustos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"46_CR1","unstructured":"Best Blends Experiments, \n                    \n                      http:\/\/www.inf.ucv.cl\/~rsoto\/best_blends\n                    \n                    \n                   (visited November 2011)"},{"key":"46_CR2","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)","DOI":"10.1145\/1066677.1066767"},{"key":"46_CR3","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 (2004)"},{"key":"46_CR4","doi-asserted-by":"crossref","unstructured":"Crawford, B., Castro, C., Monfroy, E.: Using a Choice Function for Guiding Enumeration in Constraint Solving. In: Proceedings of the 9th Mexican International Conference on Artificial Intelligence (MICAI), pp. 37\u201342. IEEE Computer Society (2010)","DOI":"10.1109\/MICAI.2010.23"},{"key":"46_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-642-21326-7_32","volume-title":"New Challenges on Bioinspired Applications","author":"B. Crawford","year":"2011","unstructured":"Crawford, B., Soto, R., Castro, C., Monfroy, E.: A Hyperheuristic Approach for Dynamic Enumeration Strategy Selection in Constraint Satisfaction. In: Ferr\u00e1ndez, J.M., \u00c1lvarez S\u00e1nchez, J.R., de la Paz, F., Toledo, F.J. (eds.) IWINAC 2011, Part II. LNCS, vol.\u00a06687, pp. 295\u2013304. Springer, Heidelberg (2011)"},{"key":"46_CR6","series-title":"CCIS","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-642-22098-2_112","volume-title":"HCI International 2011 \u2013 Posters\u2019 Extended Abstracts","author":"B. Crawford","year":"2011","unstructured":"Crawford, B., Soto, R., Castro, C., Monfroy, E.: Extensible CP-Based Autonomous Search. In: Stephanidis, C. (ed.) Posters, HCII 2011, Part I. CCIS, vol.\u00a0173, pp. 561\u2013565. Springer, Heidelberg (2011)"},{"issue":"14","key":"46_CR7","first-page":"3369","volume":"6","author":"B. Crawford","year":"2010","unstructured":"Crawford, B., Soto, R., Castro, C., Monfroy, E., Paredes, F.: An Extensible Autonomous Search Framework for Constraint Programming. Int. J. Phys. Sci.\u00a06(14), 3369\u20133376 (2010)","journal-title":"Int. J. Phys. Sci."},{"key":"46_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-642-21822-4_9","volume-title":"Modern Approaches in Applied Intelligence","author":"B. Crawford","year":"2011","unstructured":"Crawford, B., Soto, R., Montecinos, M., Castro, C., Monfroy, E.: A Framework for Autonomous Search in the Ecl\n                    i\n                  ps\n                    e\n                   Solver. In: Mehrotra, K.G., Mohan, C.K., Oh, J.C., Varshney, P.K., Ali, M. (eds.) IEA\/AIE 2011, Part I. LNCS, vol.\u00a06703, pp. 79\u201384. Springer, Heidelberg (2011)"},{"key":"46_CR9","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":"46_CR10","unstructured":"Grimes, D., Wallace, R.J.: Learning to identify global bottlenecks in constraint satisfaction search. In: Proceedings of the Twentieth International Florida Artificial Intelligence Research Society (FLAIRS) Conference, pp. 592\u2013597. AAAI Press (2007)"},{"key":"46_CR11","unstructured":"Hamadi, Y., Monfroy, E., Saubion, F.: Special issue on autonomous search. Contraint Programming Letters\u00a04 (2008)"},{"key":"46_CR12","unstructured":"Rossi, F., van Beek, P., Walsh, T.: Handbook of Constraint Programming. Elsevier (2006)"},{"key":"46_CR13","unstructured":"Soubeiga, E.: Development and Application of Hyperheuristics to Personnel Scheduling. PhD thesis, University of Nottingham School of Computer Science (2009)"},{"issue":"1-3","key":"46_CR14","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","Computational Science and Its Applications \u2013 ICCSA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31137-6_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:47:27Z","timestamp":1620128847000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31137-6_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642311369","9783642311376"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31137-6_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}