{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T17:17:38Z","timestamp":1782926258148,"version":"3.54.5"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,2,18]],"date-time":"2015-02-18T00:00:00Z","timestamp":1424217600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s11047-015-9490-9","type":"journal-article","created":{"date-parts":[[2015,2,17]],"date-time":"2015-02-17T04:53:26Z","timestamp":1424148806000},"page":"395-414","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Anytime pack search"],"prefix":"10.1007","volume":"15","author":[{"given":"Satya Gautam","family":"Vadlamudi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sandip","family":"Aine","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Partha Pratim","family":"Chakrabarti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,2,18]]},"reference":[{"key":"9490_CR1","unstructured":"Aine S, Chakrabarti PP, Kumar R (2007) AWA*\u2014a window constrained anytime heuristic search algorithm. In: IJCAI, pp 2250\u20132255"},{"issue":"1","key":"9490_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2455.2458","volume":"32","author":"A Bagchi","year":"1985","unstructured":"Bagchi A, Mahanti A (1985) Three approaches to heuristic search in networks. J ACM 32(1):1\u201327","journal-title":"J ACM"},{"key":"9490_CR3","unstructured":"Bisiani R (1987) Beam search. Encycl Artic Intell 56\u201358"},{"issue":"1\u20132","key":"9490_CR4","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/S0004-3702(01)00108-4","volume":"129","author":"B Bonet","year":"2001","unstructured":"Bonet B, Geffner H (2001) Planning as heuristic search. Artif Intell 129(1\u20132):5\u201333","journal-title":"Artif Intell"},{"key":"9490_CR5","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1613\/jair.3094","volume":"39","author":"E Burns","year":"2010","unstructured":"Burns E, Lemons S, Ruml W, Zhou R (2010) Best-first heuristic search for multicore machines. JAIR 39:689\u2013743","journal-title":"JAIR"},{"key":"9490_CR6","doi-asserted-by":"crossref","unstructured":"Dasgupta P, Mitra P, Chakrabarti PP, De Sarkar SC (1994) Multiobjective search in VLSI design. In: VLSI design. IEEE, Calcutta, India, pp 395\u2013400","DOI":"10.1109\/ICVD.1994.282726"},{"key":"9490_CR7","first-page":"49","volume-title":"Proceedings of 6th national conference on artificial intelligence (AAAI 88)","author":"T Dean","year":"1988","unstructured":"Dean T, Boddy M (1988) An analysis of time-dependent planning. Proceedings of 6th national conference on artificial intelligence (AAAI 88). MN, AAAI Press, St. Paul, pp 49\u201354"},{"issue":"3","key":"9490_CR8","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0004-3702(81)90002-3","volume":"16","author":"TG Dietterich","year":"1981","unstructured":"Dietterich TG, Michalski RS (1981) Inductive learning of structural descriptions: evaluation criteria and comparative review of selected methods. Artif Intell 16(3):257\u2013294","journal-title":"Artif Intell"},{"issue":"2","key":"9490_CR9","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1006\/jpdc.1995.1036","volume":"25","author":"MP Evett","year":"1995","unstructured":"Evett MP, Hendler JA, Mahanti A, Nau DS (1995) PRA*: massively parallel heuristic search. J Parallel Distrib Comput 25(2):133\u2013143","journal-title":"J Parallel Distrib Comput"},{"issue":"1","key":"9490_CR11","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1613\/jair.2096","volume":"28","author":"EA Hansen","year":"2007","unstructured":"Hansen EA, Zhou R (2007) Anytime heuristic search. J Artif Intell Res 28(1):267\u2013297","journal-title":"J Artif Intell Res"},{"key":"9490_CR10","unstructured":"Hansen EA, Zilberstein S, Danilchenko VA (1977) Anytime heuristic search: first results. Technical report 50, University of Massachusetts"},{"issue":"2","key":"9490_CR12","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern 4(2):100\u2013107","journal-title":"IEEE Trans Syst Sci Cybern"},{"key":"9490_CR13","doi-asserted-by":"crossref","DOI":"10.1002\/0470015721","volume-title":"Intelligent bioinformatics: the application of artificial intelligence techniques to bioinformatics problems","author":"E Keedwell","year":"2005","unstructured":"Keedwell E, Narayanan A (2005) Intelligent bioinformatics: the application of artificial intelligence techniques to bioinformatics problems. Wiley, Hoboken"},{"issue":"1\u20132","key":"9490_CR14","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/S0004-3702(01)00092-3","volume":"134","author":"RE Korf","year":"2002","unstructured":"Korf RE, Felner A (2002) Disjoint pattern database heuristics. Artif Intell 134(1\u20132):9\u201322","journal-title":"Artif Intell"},{"key":"9490_CR15","unstructured":"Kumar V, Kanal L (1982) Branch and bound formulations for sequential and parallel and\/or tree search and their applications to pattern analysis and game playing. Reports Maryland University"},{"issue":"6","key":"9490_CR17","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/BF01389001","volume":"16","author":"V Kumar","year":"1987","unstructured":"Kumar V, Rao VN (1987) Parallel depth first search. Part II. Analysis. Int J Parallel Progr 16(6):501\u2013519","journal-title":"Int J Parallel Progr"},{"key":"9490_CR16","unstructured":"Kumar V, Ramesh K, Rao VN (1988) Parallel best-first search of state-space graphs: a summary of results. In: Shrobe HE, Mitchell TM, Smith RG (eds) AAAI. The MIT Press, St. Paul, Minnesota, USA, pp 122\u2013127"},{"issue":"4","key":"9490_CR18","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1287\/opre.14.4.699","volume":"14","author":"EL Lawler","year":"1966","unstructured":"Lawler EL, Wood DE (1966) Branch-and-bound methods: a survey. Oper Res Int J 14(4):699\u2013719","journal-title":"Oper Res Int J"},{"key":"9490_CR19","doi-asserted-by":"crossref","unstructured":"Lee K-F, Hon H-W, Hwang M-Y, Mahajan S, Reddy R (1989) The sphinx speech recognition system. In: 1989 international conference on acoustics, speech, and signal processing, 1989. ICASSP-89. IEEE, pp 445\u2013448","DOI":"10.1109\/ICASSP.1989.266459"},{"issue":"3","key":"9490_CR20","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1016\/S0377-2217(96)00062-8","volume":"96","author":"G Li","year":"1997","unstructured":"Li G (1997) Single machine earliness and tardiness scheduling. Eur J Oper Res 96(3):546\u2013558","journal-title":"Eur J Oper Res"},{"key":"9490_CR21","unstructured":"Likhachev M, Gordon GJ, Thrun S (2004) ARA*: anytime A* with provable bounds on sub-optimality. In: Thrun S, Saul LK, Sch\u00f6lkopf B (eds) Advances in neural information processing systems 16. MIT Press, Cambridge"},{"key":"9490_CR22","doi-asserted-by":"crossref","unstructured":"Lowerre B (1976) The harpy speech recognition system. PhD thesis, Carnegie Mellon University","DOI":"10.1121\/1.2003089"},{"key":"9490_CR23","unstructured":"Malone B, Yuan C (2013) Evaluating anytime algorithms for learning optimal bayesian networks. CoRR, abs\/1309.6844"},{"issue":"2","key":"9490_CR24","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/359997.360004","volume":"19","author":"A Martelli","year":"1976","unstructured":"Martelli A (1976) An application of heuristic search methods to edge and contour detection. Commun ACM 19(2):73\u201383","journal-title":"Commun ACM"},{"issue":"12","key":"9490_CR25","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1145\/359657.359664","volume":"21","author":"A Martelli","year":"1978","unstructured":"Martelli A, Montanari U (1978) Optimizing decision trees through heuristically guided search. Commun ACM 21(12):1025\u20131039","journal-title":"Commun ACM"},{"key":"9490_CR26","volume-title":"Generating space telescope observation schedules","author":"N Muscettola","year":"1989","unstructured":"Muscettola N, Smith SF, Amiri G, Pathak D (1989) Generating space telescope observation schedules. Technical report, DTIC Document"},{"key":"9490_CR27","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/978-3-319-02621-3_10","volume-title":"Research and development in intelligent systems","author":"S Patra","year":"2013","unstructured":"Patra S, Vadlamudi SG, Chakrabarti PP (2013) Anytime contract search. In: Bramer M, Petridis M (eds) Research and development in intelligent systems, vol XXX. Springer International Publishing, Berlin, pp 139\u2013155"},{"issue":"3","key":"9490_CR28","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0004-3702(70)90007-X","volume":"1","author":"I Pohl","year":"1970","unstructured":"Pohl I (1970) Heuristic search viewed as path finding in a graph. Artif Intell 1(3):193\u2013204","journal-title":"Artif Intell"},{"issue":"6","key":"9490_CR29","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/BF01389000","volume":"16","author":"VN Rao","year":"1987","unstructured":"Rao VN, Kumar V (1987) Parallel depth first search. Part I. Implementation. Int J Parallel Progr 16(6):479\u2013499","journal-title":"Int J Parallel Progr"},{"key":"9490_CR30","doi-asserted-by":"crossref","unstructured":"Rao VN, Kumar V (1988) Superlinear speedup in parallel state-space search. In: Nori KV, Kumar S (eds) FSTTCS. Springer, Pune, India, pp 161\u2013174","DOI":"10.1007\/3-540-50517-2_79"},{"key":"9490_CR31","unstructured":"Rao VN, Kumar V, Ramesh K (1987) A parallel implementation of iterative-deepening-A*. In: Forbus KD, Shrobe HE (eds) AAAI. Morgan Kaufmann, Seattle, WA, USA, pp 178\u2013182"},{"key":"9490_CR32","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt G (1991) TSPLIB\u2014a traveling salesman problem library. ORSA J Comput 3:376\u2013384","journal-title":"ORSA J Comput"},{"key":"9490_CR33","doi-asserted-by":"crossref","unstructured":"Rubin S (1978) The argos image understanding system. Technical report, DTIC Document","DOI":"10.21236\/ADA066736"},{"key":"9490_CR34","volume-title":"Artificial intelligence: a modern approach","author":"SJ Russell","year":"2003","unstructured":"Russell SJ, Norvig P (2003) Artificial intelligence: a modern approach, 2nd edn. Pearson Education, Upper Saddle River","edition":"2"},{"issue":"2","key":"9490_CR35","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/S0377-2217(98)00319-1","volume":"118","author":"I Sabuncuoglu","year":"1999","unstructured":"Sabuncuoglu I, Bayiz M (1999) Job shop scheduling with beam search. Eur J Oper Res 118(2):390\u2013412","journal-title":"Eur J Oper Res"},{"issue":"1","key":"9490_CR36","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1002\/cpe.1833","volume":"25","author":"T Sch\u00fctt","year":"2013","unstructured":"Sch\u00fctt T, Reinefeld A, Maier R (2013) MR-search: massively parallel heuristic search. Concurr Comput Pract Exp 25(1):40\u201354","journal-title":"Concurr Comput Pract Exp"},{"key":"9490_CR37","unstructured":"Vadlamudi SG (2014) New algorithms and applications of searching state-space graphs and monotone multi-dimensional arrays. PhD thesis, Indian Institute of Technology Kharagpur"},{"issue":"3","key":"9490_CR38","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1109\/TSMCB.2010.2089619","volume":"41","author":"SG Vadlamudi","year":"2011","unstructured":"Vadlamudi SG, Aine S, Chakrabarti PP (2011) Mawa*\u2014a memory-bounded anytime heuristic-search algorithm. IEEE Trans Syst Man Cybern B Cybern 41(3):725\u2013735","journal-title":"IEEE Trans Syst Man Cybern B Cybern"},{"key":"9490_CR41","series-title":"CRPITACS","first-page":"209","volume-title":"Data mining and analytics 2012 (AusDM 2012)","author":"SG Vadlamudi","year":"2012","unstructured":"Vadlamudi SG, Chakrabarti PP, Sarkar S (2012a) Anytime algorithms for mining groups with maximum coverage. In: Kennedy PJ, Li J, Zhao Y, Christen P (eds) Data mining and analytics 2012 (AusDM 2012), vol 134., CRPITACSSydney, Australia, pp 209\u2013220"},{"key":"9490_CR42","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/978-3-642-35101-3_22","volume-title":"AI 2012: advances in artificial intelligence","author":"SG Vadlamudi","year":"2012","unstructured":"Vadlamudi SG, Gaurav P, Aine S, Chakrabarti PP (2012b) Anytime column search. In: Thielscher M, Zhang D (eds) AI 2012: advances in artificial intelligence, vol 7691., Lecture notes in computer scienceSpringer, Berlin, pp 254\u2013265"},{"key":"9490_CR39","doi-asserted-by":"crossref","unstructured":"Vadlamudi SG, Aine S, Chakrabarti PP (2013a) Anytime pack heuristic search. In: Maji P, Ghosh A, Narasimha Murty M, Ghosh K, Pal SK (eds) Pattern recognition and machine intelligence, volume 8251 of lecture notes in computer science. Springer, Berlin, pp 628\u2013634","DOI":"10.1007\/978-3-642-45062-4_88"},{"issue":"2224","key":"9490_CR40","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1016\/j.ipl.2013.08.010","volume":"113","author":"SG Vadlamudi","year":"2013","unstructured":"Vadlamudi SG, Aine S, Chakrabarti PP (2013b) Incremental beam search. Inf Process Lett 113(2224):888\u2013893","journal-title":"Inf Process Lett"},{"key":"9490_CR43","doi-asserted-by":"crossref","unstructured":"van den Berg J, Shah R, Huang A, Goldberg KY (2011) Anytime nonparametric A*. In: Burgard W, Roth D (eds) AAAI. AAAI Press, San Francisco, California, USA","DOI":"10.1609\/aaai.v25i1.7819"},{"issue":"3","key":"9490_CR44","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1093\/comjnl\/36.3.209","volume":"36","author":"J Leeuwen van","year":"1993","unstructured":"van Leeuwen J, Wood D (1993) Interval heaps. Comput J 36(3):209\u2013216","journal-title":"Comput J"},{"key":"9490_CR45","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1613\/jair.4039","volume":"48","author":"C Yuan","year":"2013","unstructured":"Yuan C, Malone B (2013) Learning optimal Bayesian networks: a shortest path perspective. J Artif Intell Res 48:23\u201365","journal-title":"J Artif Intell Res"},{"key":"9490_CR46","unstructured":"Zhou R, Hansen EA (2002) Multiple sequence alignment using anytime A*. In: Proceedings of 18th national conference on artificial intelligence AAAI\u20192002, pp 975\u2013976"},{"key":"9490_CR47","first-page":"90","volume-title":"Proceedings of the 15th international conference on automated planning and scheduling (ICAPS-05)","author":"R Zhou","year":"2005","unstructured":"Zhou R, Hansen EA (2005) Beam-stack search: integrating backtracking with beam search. Proceedings of the 15th international conference on automated planning and scheduling (ICAPS-05). Monterey, CA, pp 90\u201398"},{"issue":"3","key":"9490_CR48","first-page":"73","volume":"17","author":"S Zilberstein","year":"1996","unstructured":"Zilberstein S (1996) Using anytime algorithms in intelligent systems. AI Mag 17(3):73\u201383","journal-title":"AI Mag"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-015-9490-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-015-9490-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-015-9490-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,5]],"date-time":"2023-08-05T23:22:43Z","timestamp":1691277763000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-015-9490-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,18]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["9490"],"URL":"https:\/\/doi.org\/10.1007\/s11047-015-9490-9","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,18]]}}}