乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:49:24Z","timestamp":1725518964583},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540858447"},{"type":"electronic","value":"9783540858454"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85845-4_24","type":"book-chapter","created":{"date-parts":[[2008,9,22]],"date-time":"2008-09-22T02:57:04Z","timestamp":1222052224000},"page":"193-200","source":"Crossref","is-referenced-by-count":5,"title":["Partial Symbolic Pattern Databases for Optimal Sequential Planning"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Edelkamp","sequence":"first","affiliation":[]},{"given":"Peter","family":"Kissmann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"24_CR1","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1145\/77600.77615","volume":"37","author":"R.K. Ahuja","year":"1990","unstructured":"Ahuja, R.K., Mehlhorn, K., Orlin, J.B., Tarjan, R.E.: Faster algorithms for the shortest path problem. Journal of the ACM\u00a037(2), 213\u2013223 (1990)","journal-title":"Journal of the ACM"},{"key":"24_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-540-73580-9_5","volume-title":"Abstraction, Reformulation, and Approximation","author":"K. Anderson","year":"2007","unstructured":"Anderson, K., Holte, R., Schaeffer, J.: Partial pattern databases. In: Miguel, I., Ruml, W. (eds.) SARA 2007. LNCS (LNAI), vol.\u00a04612, pp. 20\u201334. Springer, Heidelberg (2007)"},{"issue":"4","key":"24_CR3","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1111\/0824-7935.00065","volume":"14","author":"J.C. Culberson","year":"1998","unstructured":"Culberson, J.C., Schaeffer, J.: Pattern databases. Computational Intelligence\u00a014(4), 318\u2013334 (1998)","journal-title":"Computational Intelligence"},{"issue":"11","key":"24_CR4","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1145\/363269.363610","volume":"12","author":"R.B. Dial","year":"1969","unstructured":"Dial, R.B.: Shortest-path forest with topological ordering. Communications of the ACM\u00a012(11), 632\u2013633 (1969)","journal-title":"Communications of the ACM"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connection with graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"issue":"1","key":"24_CR6","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0004-3702(94)90040-X","volume":"65","author":"J.F. Dillenburg","year":"1994","unstructured":"Dillenburg, J.F., Nelson, P.C.: Perimeter search. Artificial Intelligence\u00a065(1), 165\u2013178 (1994)","journal-title":"Artificial Intelligence"},{"key":"24_CR7","unstructured":"Edelkamp, S.: Symbolic pattern databases in heuristic search planning. In: AIPS, pp. 274\u2013293 (2002)"},{"key":"24_CR8","unstructured":"Edelkamp, S.: External symbolic heuristic search with pattern databases. In: ICAPS, pp. 51\u201360 (2005)"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BFb0095430","volume-title":"KI-98: Advances in Artificial Intelligence","author":"S. Edelkamp","year":"1998","unstructured":"Edelkamp, S., Reffel, F.: OBDDs in heuristic search. In: Herzog, O. (ed.) KI 1998. LNCS, vol.\u00a01504, pp. 81\u201392. Springer, Heidelberg (1998)"},{"key":"24_CR10","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1613\/jair.2241","volume":"30","author":"A. Felner","year":"2006","unstructured":"Felner, A., Korf, R.E., Meshulam, R., Holte, R.C.: Compressed pattern databases. Journal of Artificial Intelligence Research\u00a030, 213\u2013247 (2006)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"24_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-540-73580-9_14","volume-title":"Abstraction, Reformulation, and Approximation","author":"A. Felner","year":"2007","unstructured":"Felner, A., Ofek, N.: Combining perimeter search and pattern database abstractions. In: Miguel, I., Ruml, W. (eds.) SARA 2007. LNCS (LNAI), vol.\u00a04612, pp. 155\u2013168. Springer, Heidelberg (2007)"},{"key":"24_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/3-540-45622-8_7","volume-title":"Abstraction, Reformulation, and Approximation","author":"E.A. Hansen","year":"2002","unstructured":"Hansen, E.A., Zhou, R., Feng, Z.: Symbolic heuristic search using decision diagrams. In: Koenig, S., Holte, R.C. (eds.) SARA 2002. LNCS (LNAI), vol.\u00a02371, pp. 83\u201398. Springer, Heidelberg (2002)"},{"key":"24_CR13","unstructured":"Haslum, P., Bonet, B., Geffner, H.: New admissible heuristics for domain-independent planning. In: AAAI, pp. 1163\u20131168 (2005)"},{"key":"24_CR14","unstructured":"Haslum, P., Botea, A., Helmert, M., Bonet, B., Koenig, S.: Domain-independent construction of pattern database heuristics for cost-optimal planning. In: AAAI, pp. 1007\u20131012 (2007)"},{"key":"24_CR15","unstructured":"Helmert, M., Haslum, P., Hoffmann, J.: Flexible abstraction heuristics for optimal sequential planning. In: ICAPS, pp. 176\u2013183 (2007)"},{"key":"24_CR16","unstructured":"Hoffmann, J., Sabharwal, A., Domshlak, C.: Friends or foes? An AI planning perspective on abstraction and search. In: ICAPS, pp. 294\u2013303 (2006)"},{"key":"24_CR17","unstructured":"Jensen, R.M., Bryant, R.E., Veloso, M.M.: SetA*: An efficient BDD-based heuristic search algorithm. In: AAAI, pp. 668\u2013673 (2002)"},{"key":"24_CR18","unstructured":"Katz, M., Domshlak, C.: Combining perimeter search and pattern database abstractions. In: ICAPS-Workshop (2007)"},{"issue":"5","key":"24_CR19","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":"24_CR20","unstructured":"Qian, K.: Formal Verification using heursitic search and abstraction techniques. PhD thesis, University of New South Wales (2006)"},{"key":"24_CR21","unstructured":"Zhou, R., Hansen, E.: Breadth-first heuristic search. In: ICAPS, pp. 92\u2013100 (2004)"}],"container-title":["Lecture Notes in Computer Science","KI 2008: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85845-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:50:12Z","timestamp":1558266612000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85845-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540858447","9783540858454"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85845-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}