{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,25]],"date-time":"2026-09-25T12:35:33Z","timestamp":1790339733020,"version":"4.1.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,4,10]],"date-time":"2013-04-10T00:00:00Z","timestamp":1365552000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s10472-013-9347-9","type":"journal-article","created":{"date-parts":[[2013,4,9]],"date-time":"2013-04-09T09:48:28Z","timestamp":1365500908000},"page":"183-205","source":"Crossref","is-referenced-by-count":3,"title":["Iterative-deepening search with on-line tree size prediction"],"prefix":"10.1007","volume":"69","author":[{"given":"Ethan","family":"Burns","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wheeler","family":"Ruml","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,4,10]]},"reference":[{"key":"9347_CR1","doi-asserted-by":"crossref","unstructured":"Arbelaez, A., Hamadi, Y., Sebag, M.: Continuous search in constraint programming. In: 22nd IEEE International Conference on Tools with Artificial Intelligence (ICTAI-10), vol. 1, pp. 53\u201360 (2010)","DOI":"10.1109\/ICTAI.2010.17"},{"key":"9347_CR2","doi-asserted-by":"crossref","unstructured":"Battiti, R., Brunato, M., Mascia, F.: Reactive Search and Intelligent Optimization, vol.\u00a045. Springer (2008)","DOI":"10.1007\/978-0-387-09624-7"},{"issue":"3","key":"9347_CR3","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1111\/0824-7935.00065","volume":"14","author":"JC Culberson","year":"1998","unstructured":"Culberson, J.C., Schaeffer, J.: Pattern databases. Comput. Intell. 14(3), 318\u2013334 (1998)","journal-title":"Comput. Intell."},{"key":"9347_CR4","unstructured":"Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley (1998)"},{"key":"9347_CR5","first-page":"357","volume-title":"Hybrid Optimization. Springer Optimization and Its Applications","author":"Y Hamadi","year":"2010","unstructured":"Hamadi, Y., Monfroy, E., Saubion, F.: What is autonomous search? In: van Hentenryck, P., Milano, M. (eds.) Hybrid Optimization. Springer Optimization and Its Applications, vol. 45, pp. 357\u2013391. Springer, New York (2011)"},{"issue":"2","key":"9347_CR6","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"9347_CR7","unstructured":"Haslum, P., Botea, A., Helmert, M., Bonte, B., Koenig, S.: Domain-independent construction of pattern database heuristics for cost-optimal planning. In: Proceedings of the 22nd Conference on Artificial Intelligence (AAAI-07) (2007)"},{"key":"9347_CR8","unstructured":"Korf, R.E.: Iterative-deepening-A*: An optimal admissible tree search. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-85), pp. 1034\u20131036 (1985)"},{"key":"9347_CR9","doi-asserted-by":"crossref","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, 199\u2013218 (2001)","journal-title":"Artif. Intell."},{"issue":"5","key":"9347_CR10","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1145\/1089023.1089024","volume":"52","author":"RE Korf","year":"2005","unstructured":"Korf, R.E., Zhang, W., Thayer, I., Hohwald, H.: Frontier search. Journal of the ACM 52(5), 715\u2013748 (2005)","journal-title":"Journal of the ACM"},{"key":"9347_CR11","unstructured":"Lelis, L., Stern, R., Jabbari Arfaee, S.: Predicting solution cost with conditional probabilities. In: Proceedings of the 4th Annual Symposium on Combinatorial Search (SoCS-11) (2011)"},{"key":"9347_CR12","unstructured":"Malitsky, Y.: Instance-Specific Algorithm Configuration. Ph.D. Thesis, Brown University (2012)"},{"issue":"1","key":"9347_CR13","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0004-3702(84)90003-1","volume":"23","author":"L M\u00e9ro","year":"1984","unstructured":"M\u00e9ro, L.: A heuristic search algorithm with modifiable estimate. Artif. Intell. 23(1), 13\u201327 (1984)","journal-title":"Artif. Intell."},{"key":"9347_CR14","unstructured":"Nilsson, N.J.: Principles of Artificial Intelligence. Tioga Publishing Co (1980)"},{"key":"9347_CR15","unstructured":"Pearl, J.: Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley (1984)"},{"key":"9347_CR16","unstructured":"Rose, K., Burns, E., Ruml, W.: Best-first search for bounded-depth trees. In: Proceedings of the 4th Annual Symposium on Combinatorial Search (SoCS-11) (2011)"},{"key":"9347_CR17","unstructured":"Ruml, W.: Adaptive Tree Search. Ph.D. Thesis, Harvard University (2002)"},{"key":"9347_CR18","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0004-3702(91)90100-X","volume":"50","author":"U Sarkar","year":"1991","unstructured":"Sarkar, U., Chakrabarti, P., Ghose, S., Sarkar, S.D.: Reducing reexpansions in iterative-deepening search by controlling cutoff bounds. Artif. Intell. 50, 207\u2013221 (1991)","journal-title":"Artif. Intell."},{"key":"9347_CR19","doi-asserted-by":"crossref","unstructured":"Thayer, J., Ruml, W.: Using distance estimates in heuristic search. In: Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS-09) (2009)","DOI":"10.1609\/icaps.v19i1.13390"},{"key":"9347_CR20","unstructured":"Vempaty, N.R., Kumar, V., Korf, R.E.: Depth-first vs best-first search. In: Proceedings of AAAI-91, pp. 434\u2013440 (1991)"},{"issue":"4","key":"9347_CR21","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1142\/S0218213094000285","volume":"3","author":"BW Wah","year":"1995","unstructured":"Wah, B.W., Shang, Y.: Comparison and evaluation of a class of IDA* algorithms. Int. J. Artif. Intell. Tools 3(4), 493\u2013523 (1995)","journal-title":"Int. J. Artif. Intell. Tools"},{"issue":"1","key":"9347_CR22","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1613\/jair.2490","volume":"32","author":"L Xu","year":"2008","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla: portfolio-based algorithm selection for SAT. J. Artif. Intell. Res. 32(1), 565\u2013606 (2008)","journal-title":"J. Artif. Intell. Res."},{"key":"9347_CR23","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1613\/jair.2890","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. Intell. Res. 37, 41\u201383 (2010)","journal-title":"J. Artif. Intell. Res."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-013-9347-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-013-9347-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-013-9347-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,30]],"date-time":"2023-06-30T22:09:45Z","timestamp":1688162985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-013-9347-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,10]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["9347"],"URL":"https:\/\/doi.org\/10.1007\/s10472-013-9347-9","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,10]]}}}