{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T00:54:03Z","timestamp":1762390443494,"version":"3.28.0"},"reference-count":44,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,7]]},"DOI":"10.1109\/cec.2010.5585965","type":"proceedings-article","created":{"date-parts":[[2010,9,29]],"date-time":"2010-09-29T19:54:29Z","timestamp":1285790069000},"page":"1-8","source":"Crossref","is-referenced-by-count":19,"title":["Mapping the performance of heuristics for Constraint Satisfaction"],"prefix":"10.1109","author":[{"given":"Jose Carlos","family":"Ortiz-Bayliss","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ender","family":"Ozcan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew J.","family":"Parkes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hugo","family":"Terashima-Marin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","article-title":"An empirical study of phase transitions in binary constraint satisfaction problems","author":"prosser","year":"1994","journal-title":"Tech Rep Report AISL-49–94 University of Strathclyde"},{"key":"ref38","first-page":"95","article-title":"Binary constraint satisfaction problems: Some are harder than others","author":"prosser","year":"0","journal-title":"Proceedings of the European Conference in Artificial Intelligence (Amsterdam Holland 1994)"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1007\/978-1-4757-4137-7_25"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1016\/0020-0255(74)90008-5"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1016\/0004-3702(92)90007-K"},{"key":"ref30","first-page":"17","article-title":"Solving large-scale csp and scheduling problems using a heuristic repair method","author":"minton","year":"1990","journal-title":"Proceedings of the 8th AAAI Conference"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1016\/j.cor.2005.09.012"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/IDA-2008-12102","article-title":"A comprehensive analysis of hyper-heuristics","volume":"12","author":"ozcan","year":"2008","journal-title":"Intelligent Data Analysis"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1145\/1569901.1570174"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1109\/TSMCB.2005.856143","article-title":"Classification of adaptive memetic algorithms: a comparative study","volume":"36","author":"ong","year":"2006","journal-title":"IEEE Transactions on Systems Man and Cybernetics Part B"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-540-79438-7_1","article-title":"Hyperheuristics: Recent developments","volume":"136","author":"chakhlevitch","year":"2008","journal-title":"Adaptive and Multilevel Metaheuristics Studies in Computational Intelligence"},{"key":"ref11","first-page":"331","article-title":"Where the really hard problems are","author":"cheeseman","year":"1991","journal-title":"Proceedings of IJCAI-91"},{"doi-asserted-by":"publisher","key":"ref40","DOI":"10.1007\/0-387-28356-0_17"},{"key":"ref12","first-page":"21","article-title":"Experimental results on the crossover point in satisfiability problems","author":"crawford","year":"1993","journal-title":"Proceedings of the Eleventh National Conference on Artificial Intelligence"},{"key":"ref13","article-title":"Probabilistic and parametric learning combinations of local job shop scheduling rules","author":"crowston","year":"1963","journal-title":"ONR Research Memorandum"},{"key":"ref14","first-page":"276","article-title":"Constraint networks","author":"dechter","year":"1992","journal-title":"Encyclopedia of Artificial Intelligence"},{"key":"ref15","first-page":"102","article-title":"High performance ATP systems by combining several ai methods","author":"denzinger","year":"1997","journal-title":"Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI97)"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1016\/S0965-9978(00)00109-5"},{"key":"ref17","article-title":"Probabilistic learning combinations of local job-shop scheduling rules","author":"fisher","year":"0","journal-title":"Factory Scheduling Conference Carnegie Institute of Technology"},{"key":"ref18","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2122.001.0001","author":"freuder","year":"1994","journal-title":"Constraint-Based Reasoning"},{"key":"ref19","first-page":"641","article-title":"Automated discovery of composite sat variable-selection heuristics","author":"fukunaga","year":"2002","journal-title":"Eighteenth national conference on Artificial intelligence"},{"key":"ref4","first-page":"1","article-title":"An ant algorithm hyper-heuristic","volume":"10","author":"burke","year":"2003","journal-title":"Proceedings of the Fifth Metaheuristics International Conference (MIC2003)"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1145\/1389095.1389307"},{"key":"ref3","first-page":"85","article-title":"An experimental study on hyper-heuristics and exam scheduling","volume":"3867","author":"bilgin","year":"2007","journal-title":"Selected papers from the International Conference on Practice and Theory of Automated Timetabling 2006 Lecture Notes in Computer Science"},{"key":"ref27","article-title":"Emergence of profitable search strategies based on a simple inheritance mechanism","author":"krasnogor","year":"2001","journal-title":"Proceedings of the 2001 Genetic and Evolutionary Computation Conference Morgan Kaufmann"},{"key":"ref6","first-page":"177","article-title":"Exploring hyper-heuristic methodologies with genetic programming","author":"burke","year":"2009","journal-title":"Computational Intelligence Collaboration Fusion and Emergence"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1007\/0-306-48056-5_16"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1016\/0004-3702(77)90007-8"},{"key":"ref8","article-title":"A classification of hyper-heuristic approaches","author":"burke","year":"2009","journal-title":"Computer Science Tech Rep No NOTTCS-TR-SUB-0907061259–5808)"},{"key":"ref7","article-title":"A survey of hyper-heuristics","author":"burke","year":"2009","journal-title":"Computer Science Tech Rep No NOTTCS-TR-SUB-0906241418–2747"},{"key":"ref2","first-page":"1","article-title":"Reactive search: Machine learning for memory-based heuristics","author":"battiti","year":"2007","journal-title":"Approximation Algorithms and Metaheuristics"},{"key":"ref9","article-title":"New methods to colour the vertices of a graph","volume":"22","author":"brelaz","year":"1979","journal-title":"Comnunications of the ACM"},{"key":"ref1","first-page":"61","article-title":"Reactive search: Toward self-tuning heuristics","author":"battiti","year":"1996","journal-title":"Modern Heuristic Search Methods"},{"key":"ref20","first-page":"483","article-title":"Evolving local search heuristics for SAT using genetic programming","author":"fukunaga","year":"2008","journal-title":"LNCS 3103 Proceedings of the ACM Genetic and Evolutionary Computation Conference (GECCO '04)"},{"key":"ref22","article-title":"Dynamic algorithm portfolios","author":"gagliolo","year":"0","journal-title":"Proceedings AI and MATH 06 Ninth International Symposium on Artificial Intelligence and Mathematics (Fort Lauderdale Florida 2006)"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1162\/evco.2008.16.1.31"},{"key":"ref24","first-page":"179","article-title":"An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem","author":"gent","year":"1996","journal-title":"proceedings of CP-96"},{"doi-asserted-by":"publisher","key":"ref42","DOI":"10.1016\/0004-3702(95)00052-6"},{"year":"1979","author":"garey","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","key":"ref23"},{"year":"1995","author":"russell","journal-title":"Artificial Intelligence A Modern Approach","key":"ref41"},{"key":"ref44","first-page":"472","article-title":"Using deep structure to locate hard problems","author":"williams","year":"0","journal-title":"Proc of AAAI-92 (San Jose CA 1992)"},{"key":"ref26","doi-asserted-by":"crossref","DOI":"10.1126\/science.275.5296.51","article-title":"An economics approach to hard computational problems","volume":"275","author":"huberman","year":"1997","journal-title":"Science"},{"doi-asserted-by":"publisher","key":"ref43","DOI":"10.1145\/1389095.1389206"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1016\/0004-3702(80)90051-X"}],"event":{"name":"2010 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2010,7,18]]},"location":"Barcelona, Spain","end":{"date-parts":[[2010,7,23]]}},"container-title":["IEEE Congress on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5573635\/5585910\/05585965.pdf?arnumber=5585965","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,12]],"date-time":"2020-06-12T07:32:30Z","timestamp":1591947150000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5585965\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7]]},"references-count":44,"URL":"https:\/\/doi.org\/10.1109\/cec.2010.5585965","relation":{},"subject":[],"published":{"date-parts":[[2010,7]]}}}