{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T09:03:12Z","timestamp":1725872592561},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319503486"},{"type":"electronic","value":"9783319503493"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-50349-3_14","type":"book-chapter","created":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T07:12:11Z","timestamp":1480489931000},"page":"203-217","source":"Crossref","is-referenced-by-count":3,"title":["Quantifying the Similarity of Algorithm Configurations"],"prefix":"10.1007","author":[{"given":"Lin","family":"Xu","sequence":"first","affiliation":[]},{"given":"Ashiqur R.","family":"KhudaBukhsh","sequence":"additional","affiliation":[]},{"given":"Holger H.","family":"Hoos","sequence":"additional","affiliation":[]},{"given":"Kevin","family":"Leyton-Brown","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,1]]},"reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-540-24730-2_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E Clarke","year":"2004","unstructured":"Clarke, E., Kroening, D., Lerda, F.: A tool for checking ANSI-C programs. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 168\u2013176. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-24730-2_15"},{"key":"14_CR2","doi-asserted-by":"crossref","DOI":"10.1201\/9781420036121","volume-title":"Multidimensional scaling","author":"TF Cox","year":"2000","unstructured":"Cox, T.F., Cox, M.A.: Multidimensional scaling. CRC Press, Boca Raton (2000)"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/11499107_5","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2005","unstructured":"E\u00e9n, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 61\u201375. Springer, Heidelberg (2005). doi: 10.1007\/11499107_5"},{"key":"14_CR4","first-page":"1","volume":"22","author":"C Fawcett","year":"2013","unstructured":"Fawcett, C., Hoos, H.H.: Analysing differences between algorithm configurations through ablation. J. Heuristics 22, 1\u201328 (2013)","journal-title":"J. Heuristics"},{"key":"14_CR5","unstructured":"Gent, I.P., Hoos, H.H., Prosser, P., Walsh, T.: Morphing: combining structure and randomness. In: Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI 1999), pp. 654\u2013660 (1999)"},{"key":"14_CR6","unstructured":"Gomes, C.P., Selman, B.: Problem structure in the presence of perturbations. In: Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI 1997), pp. 221\u2013226 (1997)"},{"key":"14_CR7","unstructured":"Hirsch, E.A.: Random generator hgen2 of satisfiable formulas in 3-CNF (2002). http:\/\/logic.pdmi.ras.ru\/~hirsch\/benchmarks\/hgen2-1.01.tar.gz . Accessed 18 December 2015"},{"key":"14_CR8","unstructured":"Hoos, H.H.: An adaptive noise mechanism for WalkSAT. In: Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI 2002), pp. 655\u2013660 (2002)"},{"issue":"2","key":"14_CR9","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1145\/2076450.2076469","volume":"55","author":"HH Hoos","year":"2012","unstructured":"Hoos, H.H.: Programming by optimization. Commun. ACM 55(2), 70\u201380 (2012)","journal-title":"Commun. ACM"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-642-25566-3_40","volume-title":"Learning and Intelligent Optimization","author":"F Hutter","year":"2011","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configuration. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 507\u2013523. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-25566-3_40"},{"issue":"1","key":"14_CR11","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1613\/jair.2861","volume":"36","author":"F Hutter","year":"2009","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K., St\u00fctzle, T.: ParamILS: an automatic algorithm configuration framework. J. Artif. Intell. Res. (JAIR) 36(1), 267\u2013306 (2009)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/3-540-46135-3_16","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"F Hutter","year":"2002","unstructured":"Hutter, F., Tompkins, D.A.D., Hoos, H.H.: Scaling and probabilistic smoothing: efficient dynamic local search for SAT. In: Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 233\u2013248. Springer, Heidelberg (2002). doi: 10.1007\/3-540-46135-3_16"},{"key":"14_CR13","unstructured":"Hutter, F., Hoos, H., Leyton-Brown, K.: An efficient approach for assessing hyperparameter importance. In: Proceedings of the 31st International Conference on Machine Learning (ICML 2014), pp. 754\u2013762 (2014)"},{"key":"14_CR14","first-page":"751","volume":"2010","author":"S Kadioglu","year":"2010","unstructured":"Kadioglu, S., Malitsky, Y., Sellmann, M., Tierney, K.: ISAC - instance specific algorithm configuration. Eur. Conf. Artif. Intell. (ECAI) 2010, 751\u2013756 (2010)","journal-title":"Eur. Conf. Artif. Intell. (ECAI)"},{"key":"14_CR15","unstructured":"KhudaBukhsh, A.R., Xu, L., Hoos, H.H., Leyton-Brown, K.: SATenstein: automatically building local search SAT solvers from components. In: Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 517\u2013524 (2009)"},{"key":"14_CR16","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.artint.2015.11.002","volume":"232","author":"AR KhudaBukhsh","year":"2016","unstructured":"KhudaBukhsh, A.R., Xu, L., Hoos, H.H., Leyton-Brown, K.: Satenstein: automatically building local search sat solvers from components. Artif. Intell. 232, 20\u201342 (2016)","journal-title":"Artif. Intell."},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/11499107_12","volume-title":"Theory and Applications of Satisfiability Testing","author":"CM Li","year":"2005","unstructured":"Li, C.M., Huang, W.Q.: Diversification and determinism in local search for satisfiability. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 158\u2013172. Springer, Heidelberg (2005). doi: 10.1007\/11499107_12"},{"key":"14_CR18","unstructured":"Li, C.M., Wei, W., Zhang, H.: Combining adaptive noise and promising decreasing variables in local search for SAT (2007). Solver description, SAT competition 2007"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-72788-0_15","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"CM Li","year":"2007","unstructured":"Li, C.M., Wei, W., Zhang, H.: Combining adaptive noise and look-ahead in local search for SAT. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 121\u2013133. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-72788-0_15"},{"key":"14_CR20","unstructured":"Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Algorithm portfolios based on cost-sensitive hierarchical clustering. In: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, pp. 608\u2013614. AAAI Press (2013)"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-642-02777-2_31","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"M Nikoli\u0107","year":"2009","unstructured":"Nikoli\u0107, M., Mari\u0107, F., Jani\u010di\u0107, P.: Instance-based selection of policies for SAT solvers. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 326\u2013340. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-02777-2_31"},{"key":"14_CR22","unstructured":"Pham, D.N., Anbulagan, A.: Resolution enhanced SLS solver: R+AdaptNovelty+ (2007). Solver description, SAT competition 2007"},{"key":"14_CR23","doi-asserted-by":"crossref","first-page":"149","DOI":"10.3233\/SAT190042","volume":"4","author":"DN Pham","year":"2008","unstructured":"Pham, D.N., Thornton, J., Gretton, C., Sattar, A.: Combining adaptive and dynamic local search for satisfiability. J. Satisf. Boolean Model. Comput. (JSAT) 4, 149\u2013172 (2008)","journal-title":"J. Satisf. Boolean Model. Comput. (JSAT)"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/11499107_15","volume-title":"Theory and Applications of Satisfiability Testing","author":"S Prestwich","year":"2005","unstructured":"Prestwich, S.: Random walk with continuously smoothed variable weights. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 203\u2013215. Springer, Heidelberg (2005). doi: 10.1007\/11499107_15"},{"key":"14_CR25","unstructured":"Simon, L.: SAT competition random 3CNF generator (2002). www.satcompetition.org\/2003\/TOOLBOX\/genAlea.c . Accessed 18 December 2015"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Sinz, C.: Visualizing the internal structure of sat instances (preliminary report). In: SAT. Citeseer (2004)","DOI":"10.1007\/11499107_19"},{"key":"14_CR27","unstructured":"Thornton, J., Pham, D.N., Bain, S., Ferreira, V.: Additive versus multiplicative clause weighting for SAT. In: Proceedings of the Nineteenth National Conference on Artificial Intelligence (AAAI 2004), pp. 191\u2013196 (2004)"},{"key":"14_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-642-21581-0_24","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2011","author":"DAD Tompkins","year":"2011","unstructured":"Tompkins, D.A.D., Balint, A., Hoos, H.H.: Captain Jack: new variable selection heuristics in local search for SAT. In: Sakallah, K.A., Simon, L. (eds.) SAT 2011. LNCS, vol. 6695, pp. 302\u2013316. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-21581-0_24"},{"key":"14_CR29","unstructured":"Uchida, T., Watanabe, O.: Hard SAT instance generation based on the factorization problem (1999). http:\/\/www.is.titech.ac.jp\/~watanabe\/gensat\/a2\/GenAll.tar.gz"},{"key":"14_CR30","first-page":"219","volume":"4","author":"W Wei","year":"2008","unstructured":"Wei, W., Li, C.M., Zhang, H.: A switching criterion for intensification, and diversification in local search for sat. J. Satisf. Boolean Model. Comput. 4, 219\u2013237 (2008)","journal-title":"J. Satisf. Boolean Model. Comput."},{"issue":"9","key":"14_CR31","first-page":"1766","volume":"15","author":"Y Xue","year":"2001","unstructured":"Xue, Y., Wang, C., Ghenniwa, H., Shen, W.: A tree similarity measuring method and its application to ontology. J. Univ. Comput. Sci. 15(9), 1766\u20131781 (2001)","journal-title":"J. Univ. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50349-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T16:25:25Z","timestamp":1657902325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50349-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319503486","9783319503493"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50349-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}