{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T18:32:34Z","timestamp":1761676354517},"publisher-location":"Cham","reference-count":12,"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_15","type":"book-chapter","created":{"date-parts":[[2015,11,21]],"date-time":"2015-11-21T10:59:35Z","timestamp":1448103575000},"page":"166-178","source":"Crossref","is-referenced-by-count":6,"title":["Analytical Results on the BFS vs. DFS Algorithm Selection Problem: Part II: Graph 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":[{"key":"15_CR1","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":"15_CR2","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. \n                    arXiv:1509.02709\n                    \n                  [cs.AI] (2015a)","DOI":"10.1007\/978-3-319-26350-2_14"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Everitt, T., Hutter, M.: Analytical results on the BFS vs. DFS algorithm selection problem. In: 28th Australian Joint Conference on Artificial Intelligence, Part I: Tree Search (2015b)","DOI":"10.1007\/978-3-319-26350-2_14"},{"issue":"1","key":"15_CR4","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 and evaluation. Artif. Intell. 206(1), 79\u2013111 (2014)","journal-title":"Artif. Intell."},{"issue":"129","key":"15_CR5","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\u2013122 (1975)","journal-title":"Math. Comput."},{"issue":"1\u20132","key":"15_CR6","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":"15_CR7","doi-asserted-by":"crossref","unstructured":"Kotthoff, L.: Algorithm selection for combinatorial search problems: a survey. AI Magazine, pp. 1\u201317 (2014)","DOI":"10.1609\/aimag.v35i3.2460"},{"issue":"4","key":"15_CR8","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s11023-007-9079-x","volume":"17","author":"S Legg","year":"2007","unstructured":"Legg, S., Hutter, M.: Universal intelligence. Minds Mach. 17(4), 391\u2013444 (2007)","journal-title":"Minds Mach."},{"key":"15_CR9","volume-title":"Heuristics: Intelligent Search Strategies for Computer Problem Solving","author":"J Pearl","year":"1984","unstructured":"Pearl, J.: Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, Boston (1984)"},{"key":"15_CR10","unstructured":"Peixoto, T.P.: The graph-tool python library. figshare (2015)"},{"key":"15_CR11","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."},{"key":"15_CR12","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, Upper Saddle River (2010)","edition":"3"}],"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_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T16:41:51Z","timestamp":1559320911000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26350-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319263496","9783319263502"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26350-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}