{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T12:35:11Z","timestamp":1756384511740},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,11,1]],"date-time":"1994-11-01T00:00:00Z","timestamp":783648000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1994,11]]},"DOI":"10.1016\/0004-3702(94)90066-3","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T13:02:52Z","timestamp":1047646972000},"page":"195-208","source":"Crossref","is-referenced-by-count":12,"title":["Agent searching in a tree and the optimality of iterative deepening"],"prefix":"10.1016","volume":"71","author":[{"given":"Pallab","family":"Dasgupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.P.","family":"Chakrabarti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.C.","family":"DeSarkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(94)90066-3_BIB1","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1006\/inco.1993.1054","article-title":"Searching in the plane","volume":"106","author":"Baeza-Yates","year":"1993","journal-title":"Inf. Comput."},{"key":"10.1016\/0004-3702(94)90066-3_BIB2","series-title":"Proceedings Twelfth International Conference of the Chilean Computer Science Society","article-title":"Parallel searching in the plane","author":"Baeza-Yates","year":"1992"},{"key":"10.1016\/0004-3702(94)90066-3_BIB3","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0004-3702(89)90010-6","article-title":"Heuristic search in restricted memory","volume":"41","author":"Chakrabarti","year":"1989","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(94)90066-3_BIB4","series-title":"Proceedings AAAI-92","first-page":"525","article-title":"Moving target search with intelligence","author":"Ishida","year":"1992"},{"key":"10.1016\/0004-3702(94)90066-3_BIB5","series-title":"Proceedings IJCAI-91","first-page":"204","article-title":"Moving target search","author":"Ishida","year":"1991"},{"key":"10.1016\/0004-3702(94)90066-3_BIB6","series-title":"Proceedings 27th Annual Symposium on Foundations of Computer Science","first-page":"19","article-title":"On a search problem related to branch-and-bound procedures","author":"Karp","year":"1986"},{"key":"10.1016\/0004-3702(94)90066-3_BIB7","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","article-title":"Depth-first iterative-deepening: an optimal admissible tree search","volume":"27","author":"Korf","year":"1985","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(94)90066-3_BIB8","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0004-3702(90)90054-4","article-title":"Real time heuristic search","volume":"42","author":"Korf","year":"1990","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(94)90066-3_BIB9","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0004-3702(93)90045-D","article-title":"Linear-space best-first search","volume":"62","author":"Korf","year":"1993","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(94)90066-3_BIB10","series-title":"Proceedings AAAI-92","first-page":"539","article-title":"Performance of IDA\u2217 on trees and graphs","author":"Mahanti","year":"1992"},{"key":"10.1016\/0004-3702(94)90066-3_BIB11","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0304-3975(91)90263-2","article-title":"Shortest paths without a map","volume":"84","author":"Papadimitriou","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0004-3702(94)90066-3_BIB12","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0004-3702(91)90100-X","article-title":"Reducing reexpansions in iterative-deepening search by controlling cutoff bounds","volume":"50","author":"Sarkar","year":"1991","journal-title":"Artif. Intell."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370294900663?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370294900663?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T00:57:01Z","timestamp":1553648221000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370294900663"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,11]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,11]]}},"alternative-id":["0004370294900663"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(94)90066-3","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1994,11]]}}}