{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:42:02Z","timestamp":1725896522017},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642344121"},{"type":"electronic","value":"9783642344138"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34413-8_1","type":"book-chapter","created":{"date-parts":[[2012,10,1]],"date-time":"2012-10-01T05:58:57Z","timestamp":1349071137000},"page":"1-15","source":"Crossref","is-referenced-by-count":3,"title":["Iterative-Deepening Search with On-Line Tree Size Prediction"],"prefix":"10.1007","author":[{"given":"Ethan","family":"Burns","sequence":"first","affiliation":[]},{"given":"Wheeler","family":"Ruml","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P.E. Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. Journal on Data Semantics I\u00a04(2), 100\u2013107 (1968)","journal-title":"IEEE Transactions of Systems Science and Cybernetics SSC"},{"key":"1_CR2","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 Twenty-Second Conference on Artificial Intelligence (AAAI 2007) (July 2007)"},{"key":"1_CR3","unstructured":"Korf, R.E.: Iterative-deepening-A*: An optimal admissible tree search. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI 1985), pp. 1034\u20131036 (1985)"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0004-3702(01)00094-7","volume":"129","author":"R.E. Korf","year":"2001","unstructured":"Korf, R.E., Reid, M., Edelkamp, S.: Time complexity of iterative-deepening-A*. Artificial Intelligence\u00a0129, 199\u2013218 (2001)","journal-title":"Artificial Intelligence"},{"issue":"5","key":"1_CR5","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1145\/1089023.1089024","volume":"52","author":"R.E. Korf","year":"2005","unstructured":"Korf, R.E., Zhang, W., Thayer, I., Hohwald, H.: Frontier search. Journal of the ACM\u00a052(5), 715\u2013748 (2005)","journal-title":"Journal of the ACM"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"M\u00e9ro, L.: A heuristic search algorithm with modifiable estimate. Artificial Intelligence, 13\u201327 (1984)","DOI":"10.1016\/0004-3702(84)90003-1"},{"key":"1_CR7","unstructured":"Pearl, J.: Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley (1984)"},{"key":"1_CR8","unstructured":"Rose, K., Burns, E., Ruml, W.: Best-first search for bounded-depth trees. In: The 2011 International Symposium on Combinatorial Search (SOCS 2011) (2011)"},{"key":"1_CR9","unstructured":"Ruml, W.: Adaptive Tree Search. Ph.D. thesis, Harvard University (May 2002)"},{"key":"1_CR10","doi-asserted-by":"publisher","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. Artificial Intelligence\u00a050, 207\u2013221 (1991)","journal-title":"Artificial Intelligence"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Thayer, J., Ruml, W.: Using distance estimates in heuristic search. In: Proceedings of ICAPS 2009 (2009)","DOI":"10.1609\/icaps.v19i1.13390"},{"key":"1_CR12","unstructured":"Vempaty, N.R., Kumar, V., Korf, R.E.: Depth-first vs best-first search. In: Proceedings of AAAI 1991, pp. 434\u2013440 (1991)"},{"issue":"4","key":"1_CR13","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1142\/S0218213094000285","volume":"3","author":"B.W. Wah","year":"1995","unstructured":"Wah, B.W., Shang, Y.: Comparison and evaluation of a class of IDA* algorithms. International Journal on Artificial Intelligence Tools\u00a03(4), 493\u2013523 (1995)","journal-title":"International Journal on Artificial Intelligence Tools"},{"key":"1_CR14","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. Journal of Artificial Intelligence Research\u00a037, 41\u201383 (2010)","journal-title":"Journal of Artificial Intelligence Research"}],"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-642-34413-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T00:54:30Z","timestamp":1687740870000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34413-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642344121","9783642344138"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34413-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}