{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T23:38:37Z","timestamp":1725838717479},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319263496"},{"type":"electronic","value":"9783319263502"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-26350-2_14","type":"book-chapter","created":{"date-parts":[[2015,11,21]],"date-time":"2015-11-21T05:59:35Z","timestamp":1448085575000},"page":"157-165","source":"Crossref","is-referenced-by-count":8,"title":["Analytical Results on the BFS vs. DFS Algorithm Selection Problem. Part I: Tree Search"],"prefix":"10.1007","author":[{"given":"Tom","family":"Everitt","sequence":"first","affiliation":[]},{"given":"Marcus","family":"Hutter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,22]]},"reference":[{"issue":"2","key":"14_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1137\/0221022","volume":"21","author":"PC Chen","year":"1992","unstructured":"Chen, P.C.: Heuristic sampling: a method for predicting the performance of tree searching programs. SIAM J. Comput. 21(2), 295\u2013315 (1992)","journal-title":"SIAM J. Comput."},{"key":"14_CR2","volume-title":"Heuristic Search","author":"S Edelkamp","year":"2012","unstructured":"Edelkamp, S., Schr\u00f6dl, S.: Heuristic Search. Morgan Kaufmann Publishers Inc., San Francisco (2012)"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Everitt, T., Hutter, M.: A topological approach to meta-heuristics: analytical results on the BFS vs. DFS algorithm selection problem. Technical report, Australian National University (2015a). \n                    arXiv:1509.02709\n                    \n                   [cs.AI]","DOI":"10.1007\/978-3-319-26350-2_14"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Everitt, T., Hutter, M.: Analytical results on the BFS vs. DFS algorithm selection problem. Part II: graph search. In: 28th Australian Joint Conference on Artificial Intelligence (2015b)","DOI":"10.1007\/978-3-319-26350-2_15"},{"issue":"1","key":"14_CR5","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.artint.2013.10.003","volume":"206","author":"F Hutter","year":"2014","unstructured":"Hutter, F., Xu, L., Hoos, H.H., Leyton-Brown, K.: Algorithm runtime prediction: methods & evaluation. Artif. Intell. 206(1), 79\u2013111 (2014)","journal-title":"Artif. Intell."},{"key":"14_CR6","unstructured":"Kilby, P., Slaney, J., Thi\u00e9baux, S., Walsh, T.: Estimating search tree size. In: Proceedings of the 21st National Conference of Artificial Intelligence. AAAI, Menlo Park (2006)"},{"issue":"129","key":"14_CR7","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1090\/S0025-5718-1975-0373371-6","volume":"29","author":"DE Knuth","year":"1975","unstructured":"Knuth, D.E.: Estimating the efficiency of backtrack programs. Math. Comput. 29(129), 122\u2013136 (1975)","journal-title":"Math. Comput."},{"issue":"1\u20132","key":"14_CR8","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0004-3702(01)00094-7","volume":"129","author":"RE Korf","year":"2001","unstructured":"Korf, R.E., Reid, M., Edelkamp, S.: Time complexity of iterative-deepening-A*. Artif. Intell. 129(1\u20132), 199\u2013218 (2001)","journal-title":"Artif. Intell."},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Kotthoff, L.: Algorithm selection for combinatorial search problems: a survey. AI Mag., 1\u201317 (2014)","DOI":"10.1609\/aimag.v35i3.2460"},{"key":"14_CR10","unstructured":"Lelis, L.H.S., Otten, L., and Dechter, R.: Predicting the size of Depth-first Branch and Bound search trees. In: IJCAI International Joint Conference on Artificial Intelligence, pp. 594\u2013600 (2013)"},{"key":"14_CR11","unstructured":"Peixoto, T.P.: The graph-tool python library. figshare (2015)"},{"issue":"4","key":"14_CR12","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1137\/0207038","volume":"7","author":"PW Purdom","year":"1978","unstructured":"Purdom, P.W.: Tree size by partial backtracking. SIAM J. Comput. 7(4), 481\u2013491 (1978)","journal-title":"SIAM J. Comput."},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"JR Rice","year":"1975","unstructured":"Rice, J.R.: The algorithm selection problem. Adv. Comput. 15, 65\u2013117 (1975)","journal-title":"Adv. Comput."},{"issue":"2","key":"14_CR14","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.1137\/120867366","volume":"27","author":"T Rokicki","year":"2013","unstructured":"Rokicki, T., Kociemba, H.: The diameter of the rubiks cube group is twenty. SIAM J. Discrete Math. 27(2), 1082\u20131105 (2013)","journal-title":"SIAM J. Discrete Math."},{"key":"14_CR15","volume-title":"Artificial Intelligence: A Modern Approach","author":"SJ Russell","year":"2010","unstructured":"Russell, S.J., Norvig, P.: Artificial Intelligence: A Modern Approach, 3rd edn. Prentice Hall, Englewood Cliffs (2010)","edition":"3"},{"key":"14_CR16","first-page":"41","volume":"37","author":"U Zahavi","year":"2010","unstructured":"Zahavi, U., Felner, A., Burch, N., Holte, R.C.: Predicting the performance of IDA* using conditional distributions. J. Artif. Int. Res. 37, 41\u201383 (2010)","journal-title":"J. Artif. Int. Res."}],"container-title":["Lecture Notes in Computer Science","AI 2015: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26350-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T12:38:14Z","timestamp":1559306294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26350-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319263496","9783319263502"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26350-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}