{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:47:22Z","timestamp":1772120842302,"version":"3.50.1"},"reference-count":42,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2014,5,1]],"date-time":"2014-05-01T00:00:00Z","timestamp":1398902400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2014,5]]},"abstract":"<jats:p>Using machine learning to predict algorithm runtime.<\/jats:p>","DOI":"10.1145\/2594413.2594424","type":"journal-article","created":{"date-parts":[[2014,4,28]],"date-time":"2014-04-28T15:24:14Z","timestamp":1398698654000},"page":"98-107","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":36,"title":["Understanding the empirical hardness of\n            <i>NP<\/i>\n            -complete problems"],"prefix":"10.1145","volume":"57","author":[{"given":"Kevin","family":"Leyton-Brown","sequence":"first","affiliation":[{"name":"University of British Columbia, Canada"}]},{"given":"Holger H.","family":"Hoos","sequence":"additional","affiliation":[{"name":"University of British Columbia, Canada"}]},{"given":"Frank","family":"Hutter","sequence":"additional","affiliation":[{"name":"University of Freiburg, Germany"}]},{"given":"Lin","family":"Xu","sequence":"additional","affiliation":[{"name":"University of British Columbia, Canada"}]}],"member":"320","published-online":{"date-parts":[[2014,5]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"514","author":"Ahmadizadeh K.","year":"2010","journal-title":"Proceedings for Principles and Practice of Constraint Programming ("},{"key":"e_1_2_1_2_1","volume-title":"Princeton University Press","author":"Applegate D.L.","year":"2006"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1770351.1770406"},{"key":"e_1_2_1_4_1","volume-title":"SAT 2007 Competition.","author":"Babi\u0107 D."},{"key":"e_1_2_1_5_1","volume-title":"Springer","author":"Bishop C.M.","year":"2006"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010933404324"},{"key":"e_1_2_1_7_1","volume-title":"Wadsworth","author":"Breiman L.","year":"1984"},{"key":"e_1_2_1_8_1","volume-title":"Proceedings for International Joint Conference on Artificial Intelligence","author":"Cheeseman P.","year":"1991"},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","unstructured":"E\u00e9n N. and S\u00f6rensson N. An extensible SAT-solver. Theory and Applications of Satisfiability Testing (2004) 502--518.  E\u00e9n N. and S\u00f6rensson N. An extensible SAT-solver. Theory and Applications of Satisfiability Testing (2004) 502--518.","DOI":"10.1007\/978-3-540-24605-3_37"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176347963"},{"key":"e_1_2_1_11_1","volume-title":"SAT 2009 competition.","author":"Heule M."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2076450.2076469"},{"key":"e_1_2_1_13_1","volume-title":"Pearson Education","author":"Hopcroft J.E.","year":"2007"},{"key":"e_1_2_1_14_1","unstructured":"Hutter F. Automated Configuration of Algorithms for Solving Hard Computational Problems. Ph.D. thesis University Of British Columbia Department of Computer Science Vancouver Canada (Oct. 2009).  Hutter F. Automated Configuration of Algorithms for Solving Hard Computational Problems. Ph.D. thesis University Of British Columbia Department of Computer Science Vancouver Canada (Oct. 2009)."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1333874.1334161"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11889205_17"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13520-0_23"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-010-9191-0"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25566-3_40"},{"key":"e_1_2_1_20_1","first-page":"233","author":"Hutter F","year":"2002","journal-title":"SAT. In Proceedings for Principles and Practice of Constraint Programming ("},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.10.003"},{"key":"e_1_2_1_22_1","unstructured":"IBM. &lt;code&gt;CPLEX&lt;\/code&gt; Optimizer 2014. http:\/\/www-01.ibm.com\/software\/commerce\/optimization\/cplex-optimizer\/.  IBM. &lt;code&gt;CPLEX&lt;\/code&gt; Optimizer 2014. http:\/\/www-01.ibm.com\/software\/commerce\/optimization\/cplex-optimizer\/."},{"key":"e_1_2_1_23_1","unstructured":"Johnson D.S. Random TSP generators for the DIMACS TSP Challenge 2011; http:\/\/dimacs.rutgers.edu\/Challenges\/TSP\/.  Johnson D.S. Random TSP generators for the DIMACS TSP Challenge 2011; http:\/\/dimacs.rutgers.edu\/Challenges\/TSP\/."},{"key":"e_1_2_1_24_1","volume-title":"Proceedings for International Joint Conference on Artificial Intelligence","author":"KhudaBukhsh A.","year":"2009"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1975-0373371-6"},{"key":"e_1_2_1_26_1","first-page":"899","author":"Leyton-Brown K.","year":"2003","journal-title":"Proceedings for Principles and Practice of Constraint Programming ("},{"key":"e_1_2_1_27_1","volume-title":"Proceedings for International Joint Conference on Artificial Intelligence","author":"Leyton-Brown K.","year":"2003"},{"key":"e_1_2_1_28_1","first-page":"556","author":"Leyton-Brown K.","year":"2002","journal-title":"Proceedings for Principles and Practice of Constraint Programming ("},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1538902.1538906"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/352871.352879"},{"key":"e_1_2_1_31_1","volume-title":"Proceedings for Conference on Artificial Intelligence","author":"Mitchell D.","year":"1992"},{"key":"e_1_2_1_32_1","volume-title":"SAT Competition","author":"Nudelman E.","year":"2003"},{"key":"e_1_2_1_33_1","first-page":"438","author":"Nudelman E.","year":"2004","journal-title":"Proceedings for Principles and Practice of Constraint Programming ("},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-004-0183-4"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)60520-3"},{"key":"e_1_2_1_36_1","volume-title":"Proceedings for Conference on Artificial Intelligence","author":"Selman B.","year":"1992"},{"key":"e_1_2_1_37_1","volume-title":"Proceedings for Automated Planning and Scheduling Workshop on Planning and Learning","author":"Vallati M.","year":"2011"},{"key":"e_1_2_1_38_1","first-page":"696","author":"Xu L.","year":"2007","journal-title":"SAT. In Proceedings for Principles and Practice of Constraint Programming ("},{"key":"e_1_2_1_39_1","volume-title":"Proceedings for Conference on Artificial Intelligence","author":"Xu L.","year":"2012"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622673.1622687"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31612-8_18"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/11499107_25"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2594413.2594424","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2594413.2594424","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:00:52Z","timestamp":1750230052000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2594413.2594424"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5]]},"references-count":42,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["10.1145\/2594413.2594424"],"URL":"https:\/\/doi.org\/10.1145\/2594413.2594424","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5]]},"assertion":[{"value":"2014-05-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}