{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:28:33Z","timestamp":1725730113263},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642389887"},{"type":"electronic","value":"9783642389894"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38989-4_29","type":"book-chapter","created":{"date-parts":[[2013,6,5]],"date-time":"2013-06-05T19:17:56Z","timestamp":1370459876000},"page":"284-293","source":"Crossref","is-referenced-by-count":2,"title":["A Supervised Learning Approach to Construct Hyper-heuristics for Constraint Satisfaction"],"prefix":"10.1007","author":[{"given":"Jos\u00e9 Carlos","family":"Ortiz-Bayliss","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hugo","family":"Terashima-Mar\u00edn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Santiago Enrique","family":"Conant-Pablos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/978-3-540-77345-0_25","volume-title":"Practice and Theory of Automated Timetabling VI","author":"B. Bilgin","year":"2007","unstructured":"Bilgin, B., \u00d6zcan, E., Korkmaz, E.E.: An experimental study on hyper-heuristics and exam timetabling. In: Burke, E.K., Rudov\u00e1, H. (eds.) PATAT 2007. LNCS, vol.\u00a03867, pp. 394\u2013412. Springer, Heidelberg (2007)"},{"issue":"11","key":"29_CR2","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1145\/361219.361224","volume":"18","author":"J.R. Bitner","year":"1975","unstructured":"Bitner, J.R., Reingold, E.M.: Backtrack programming techniques. Communications of the ACM\u00a018(11), 651\u2013656 (1975)","journal-title":"Communications of the ACM"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Bittle, S.A., Fox, M.S.: Learning and using hyper-heuristics for variable and value ordering in constraint satisfaction problems. In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers, pp. 2209\u20132212. ACM (2009)","DOI":"10.1145\/1570256.1570304"},{"key":"29_CR4","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: European Conference on Artificial Intelligence (ECAI 2004), pp. 146\u2013150 (2004)"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Burke, E., Hart, E., Kendall, G., Newall, J., Ross, P., Shulenburg, S.: Hyper-heuristics: an emerging direction in modern research technology. In: Handbook of Metaheuristics, pp. 457\u2013474. Kluwer Academic Publishers (2003)","DOI":"10.1007\/0-306-48056-5_16"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., \u00d6zcan, E., Woodward, J.R.: A classification of hyper-heuristic approaches. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research and Management Science, vol.\u00a0146, pp. 449\u2013468. Springer (2010)","DOI":"10.1007\/978-1-4419-1665-5_15"},{"key":"29_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1007\/3-540-45712-7_82","volume-title":"Parallel Problem Solving from Nature - PPSN VII","author":"P. Cowling","year":"2002","unstructured":"Cowling, P., Kendall, G., Soubeiga, E.: Hyperheuristics: A robust optimisation method applied to nurse scheduling. In: Guerv\u00f3s, J.J.M., Adamidis, P.A., Beyer, H.-G., Fern\u00e1ndez-Villaca\u00f1as, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol.\u00a02439, pp. 851\u2013860. Springer, Heidelberg (2002)"},{"key":"29_CR8","unstructured":"Fisher, H., Thompson, G.L.: Probabilistic learning combinations of local job-shop scheduling rules. In: Factory Scheduling Conference. Carnegie Institute of Technology (1961)"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Freuder, E.C., Mackworth, A.K.: Constraint-Based Reasoning. MIT\/Elsevier (1994)","DOI":"10.7551\/mitpress\/2122.001.0001"},{"issue":"11","key":"29_CR10","doi-asserted-by":"publisher","first-page":"958","DOI":"10.1145\/359642.359654","volume":"21","author":"E.C. Freuder","year":"1978","unstructured":"Freuder, E.C.: Synthesizing constraint expressions. Communications of the ACM\u00a021(11), 958\u2013966 (1978)","journal-title":"Communications of the ACM"},{"key":"29_CR11","unstructured":"Gaschnig, J.G.: A general backtrack algorithm that eliminates most redundant tests. In: Proceedings of the 5th International Joint Conference on Artificial Intelligence, vol.\u00a01, p. 457. Morgan Kaufmann Publishers (1977)"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/3-540-61551-2_74","volume-title":"Principles and Practice of Constraint Programming - CP\u201996","author":"I. Gent","year":"1996","unstructured":"Gent, I., MacIntyre, E., Prosser, P., Smith, B., Wals, T.: An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem. In: Freuder, E.C. (ed.) CP 1996. LNCS, vol.\u00a01118, pp. 179\u2013193. Springer, Heidelberg (1996)"},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R.M. Haralick","year":"1980","unstructured":"Haralick, R.M., Elliott, G.L.: Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence\u00a014, 263\u2013313 (1980)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"29_CR14","first-page":"32","volume":"13","author":"V. Kumar","year":"1992","unstructured":"Kumar, V.: Algorithms for constraint satisfaction: a survey. AI Magazine\u00a013(1), 32\u201344 (1992)","journal-title":"AI Magazine"},{"key":"29_CR15","first-page":"549","volume-title":"Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2004","author":"C. Lecoutre","year":"2004","unstructured":"Lecoutre, C., Boussemart, F., Hemery, F.: Backjump-based techniques versus conflict-directed heuristics. In: Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2004, pp. 549\u2013557. IEEE Computer Society, Washington, DC (2004)"},{"key":"29_CR16","unstructured":"Minton, S., Phillips, A., Laird, P.: Solving large-scale CSP and scheduling problems using a heuristic repair method. In: Proceedings of the 8th AAAI Conference, pp. 17\u201324 (1990)"},{"key":"29_CR17","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","volume":"7","author":"U. Montanari","year":"1974","unstructured":"Montanari, U.: Networks of constraints: fundamentals properties and applications to picture processing. Information Sciences\u00a07, 95\u2013132 (1974)","journal-title":"Information Sciences"},{"key":"29_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-21587-2_27","volume-title":"Pattern Recognition","author":"J. Ortiz-Bayliss","year":"2011","unstructured":"Ortiz-Bayliss, J., Terashima-Mar\u00edn, H., Conant-Pablos, S.: Neural networks to guide the selection of heuristics within constraint satisfaction problems. In: Mart\u00ednez-Trinidad, J., Carrasco-Ochoa, J., Ben-Youssef Brants, C., Hancock, E. (eds.) MCPR 2011. LNCS, vol.\u00a06718, pp. 250\u2013259. Springer, Heidelberg (2011)"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"Ortiz-Bayliss, J.C., \u00d6zcan, E., Parkes, A.J., Terashima-Mar\u00edn, H.: Mapping the performance of heuristics for constraint satisfaction. In: Proceedings of the 2010 IEEE Congress on Evolutionary Computation (CEC 2010), pp. 1\u20138. IEEE Press (2010)","DOI":"10.1109\/CEC.2010.5585965"},{"issue":"4","key":"29_CR20","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.patrec.2012.09.009","volume":"34","author":"J.C. Ortiz-Bayliss","year":"2013","unstructured":"Ortiz-Bayliss, J.C., Terashima-Mar\u00edn, H., Conant-Pablos, S.E.: Learning vector quantization for variable ordering in constraint satisfaction problems. Pattern Recogn. Lett.\u00a034(4), 423\u2013432 (2013)","journal-title":"Pattern Recogn. Lett."},{"issue":"1","key":"29_CR21","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/IDA-2008-12102","volume":"12","author":"E. \u00d6zcan","year":"2008","unstructured":"\u00d6zcan, E., Bilgin, B., Korkmaz, E.E.: A comprehensive analysis of hyper-heuristics. Intelligent Data Analysis\u00a012(1), 3\u201323 (2008)","journal-title":"Intelligent Data Analysis"},{"key":"29_CR22","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0004-3702(83)80007-1","volume":"21","author":"P.W. Purdom","year":"1983","unstructured":"Purdom, P.W.: Search rearrangement backtracking and polynomial average time. Artificial Intelligence\u00a021, 117\u2013133 (1983)","journal-title":"Artificial Intelligence"},{"key":"29_CR23","unstructured":"Rossi, F., Petrie, C., Dhar, V.: On the equivalence of constraint satisfaction problems. In: Proceedings of the 9th European Conference on Artificial Intelligence, pp. 550\u2013556 (1990)"},{"key":"29_CR24","unstructured":"Russell, S., Norvig, P.: Artificial Intelligence A Modern Approach. Prentice Hall (1995)"},{"key":"29_CR25","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0004-3702(95)00052-6","volume":"81","author":"B.M. Smith","year":"1996","unstructured":"Smith, B.M.: Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence\u00a081, 155\u2013181 (1996)","journal-title":"Artificial Intelligence"},{"issue":"10","key":"29_CR26","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","volume":"38","author":"R.H. Storer","year":"1992","unstructured":"Storer, R.H., Wu, S.D., Vaccari, R.: New search spaces for sequencing problems with application to job shop scheduling. Management Science\u00a038(10), 1495\u20131509 (1992)","journal-title":"Management Science"},{"key":"29_CR27","doi-asserted-by":"crossref","unstructured":"Terashima-Mar\u00edn, H., Ortiz-Bayliss, J.C., Ross, P., Valenzuela-Rend\u00f3n, M.: Hyper-heuristics for the dynamic variable ordering in constraint satisfaction problems. In: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation (GECCO 2008), pp. 571\u2013578. ACM (2008)","DOI":"10.1145\/1389095.1389206"},{"key":"29_CR28","unstructured":"Terashima-Mar\u00edn, H., Ross, P., Valenzuela-Rend\u00f3n, M.: Evolution of constraint satisfaction strategies in examination timetabling. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 1999), pp. 635\u2013642. Morgan Kaufmann (1999)"},{"key":"29_CR29","unstructured":"Tsang, E., Kwan, A.: Mapping constraint satisfaction problems to algorithms and heuristics. Tech. Rep. CSM-198, Department of Computer Sciences, University of Essex (1993)"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38989-4_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T21:18:24Z","timestamp":1595884704000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38989-4_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642389887","9783642389894"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38989-4_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}