{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:05:25Z","timestamp":1725599125563},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678809"},{"type":"electronic","value":"9783642583223"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/978-3-642-58322-3_8","type":"book-chapter","created":{"date-parts":[[2011,8,5]],"date-time":"2011-08-05T03:05:05Z","timestamp":1312513505000},"page":"65-77","source":"Crossref","is-referenced-by-count":0,"title":["Neue Wege in der Exploration"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Edelkamp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","volume-title":"PhD thesis","author":"CA Br\u00f6cker","year":"1999","unstructured":"C. A. Br\u00f6cker. Verteilte Visualisierung geometrischer Algorithmen und Anwendungen auf Navigationsverfahren in unbekannter Umgebung. PhD thesis, Institut f\u00fcr angewandte Wissenschaften, Universit\u00e4t Freiburg, 1999."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1145\/317825.317964","volume-title":"Proceedings of the 22nd ACM\/IEEE Design Automation Conference","author":"RE Bryant","year":"1985","unstructured":"R. E. Bryant. Symbolic manipulation of boolean functions using a graphical representation. In Proceedings of the 22nd ACM\/IEEE Design Automation Conference, pages 688\u2013694. IEEE Computer Society Press, 1985."},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269\u2013271, 1959.","journal-title":"Numerische Mathematik"},{"key":"8_CR4","first-page":"381","volume-title":"KI-97, volume 1303","author":"S Edelkamp","year":"1997","unstructured":"S. Edelkamp. Suffix tree automata in state space search. In KI-97, volume 1303, pages 381\u2013385. Springer, 1997."},{"key":"8_CR5","volume-title":"PhD thesis","author":"S Edelkamp","year":"1999","unstructured":"S. Edelkamp. Datenstrukturen und Lernverfahren in der Zustandsraumsuche. PhD thesis, University of Freiburg, 1999. DISKI, Infix, Band 201."},{"key":"8_CR6","series-title":"Technical Report","volume-title":"Multi suffix tree dictionary in optimal space","author":"S Edelkamp","year":"1999","unstructured":"S. Edelkamp. Multi suffix tree dictionary in optimal space. Technical Report 129, University of Freiburg, 1999."},{"key":"8_CR7","volume-title":"ECAI-Workshop: PuK","author":"S Edelkamp","year":"2000","unstructured":"S. Edelkamp. Heuristic search planning with BDDs. In ECAI-Workshop: PuK, 2000."},{"key":"8_CR8","series-title":"Technical Report WS-97-10","volume-title":"New strategies in real-time heuristic search","author":"S Edelkamp","year":"1997","unstructured":"S. Edelkamp and J. Eckerle. New strategies in real-time heuristic search. Technical Report WS-97-10, To be ordered from the AAAI Press, 1997."},{"key":"8_CR9","first-page":"135","volume-title":"ECP-99, LNAI","author":"M Helmert","year":"1999","unstructured":"S. Edelkamp and M. Helmert. Exhibiting knowledge in planning problems to minimize state encoding length. In ECP-99, LNAI, pages 135\u2013147. Springer, 1999."},{"key":"8_CR10","series-title":"Accepted to Workshop on Model Theoretic Approaches to Planning AIPS-2000","volume-title":"On the implementation of MIPS","author":"S Edelkamp","year":"2000","unstructured":"S. Edelkamp and M. Helmert. On the implementation of MIPS. Accepted to Workshop on Model Theoretic Approaches to Planning AIPS-2000, 2000."},{"key":"8_CR11","unstructured":"S. Edelkamp and R. E. Korf. The branching factor of regular search spaces. In AAAI, 1998. 299\u2013304."},{"key":"8_CR12","first-page":"81","volume-title":"KI-98","author":"F Reffel","year":"1998","unstructured":"S. Edelkamp and F. Reffel. OBDDs in heuristic search. In KI-98, pages 81\u201392. Springer, 1998."},{"key":"8_CR13","unstructured":"S. Edelkamp and S. Schr\u00f6dl. Localizing A*. Accepted to AAAI-2000."},{"key":"8_CR14","series-title":"Technical Report CSR-98-01","volume-title":"Learning dead ends in Sokoban","author":"S Edelkamp","year":"1998","unstructured":"S. Edelkamp and S. Schr\u00f6dl. Learning dead ends in Sokoban. Technical Report CSR-98-01, Fakult\u00e4t f\u00fcr Informatik, TU Chemnitz, 1998."},{"key":"8_CR15","unstructured":"D. Furcy and S. Koenig. Speeding up the convergence in real-time search. Accepted to AAAI-2000."},{"key":"8_CR16","first-page":"100","volume":"4","author":"PE Hart","year":"1968","unstructured":"P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for heuristic determination of minimum path cost. IEEE Trans. on SSC, 4:100, 1968.","journal-title":"IEEE Trans. on SSC"},{"key":"8_CR17","volume-title":"PhD thesis","author":"A Junghanns","year":"1999","unstructured":"A. Junghanns. Pushing the Limits: New Developments in Single-Agent Search. PhD thesis, University of Alberta, 1999."},{"issue":"2\u20133","key":"8_CR18","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0004-3702(90)90054-4","volume":"42","author":"RE Korf","year":"1990","unstructured":"R. E. Korf. Real-time heuristic search. Artificial Intelligence, 42(2\u20133): 189\u2013211, 1990.","journal-title":"Artificial Intelligence"},{"key":"8_CR19","first-page":"700","volume-title":"AAAI-97","author":"RE Korf","year":"1997","unstructured":"R. E. Korf. Finding optimal solutions to Rubik\u2019s cube using pattern databases. In AAAI-97, pages 700\u2013705, 1997."},{"key":"8_CR20","volume-title":"Problems on Algorithms","author":"I Parberry","year":"1995","unstructured":"I. Parberry. Problems on Algorithms. Prentience Hall, 1995."},{"key":"8_CR21","first-page":"195","volume-title":"FM-99","author":"S Edelkamp","year":"1999","unstructured":"F. Reffel and S. Edelkamp. Error detection with directed symbolic model checking. In FM-99, pages 195\u2013211. Springer, 1999."},{"key":"8_CR22","volume-title":"Reinforcement Learning: An Introduction","author":"RS Sutton","year":"1998","unstructured":"R. S. Sutton and A. G. Barto. Reinforcement Learning: An Introduction. MIT Press, 1998."},{"key":"8_CR23","first-page":"756","volume-title":"AAAI","author":"LA Taylor","year":"1993","unstructured":"L. A. Taylor and R. E. Korf. Pruning duplicate nodes in depth-first search. In AAAI, pages 756\u2013761, 1993."},{"key":"8_CR24","series-title":"Technical report","volume-title":"No free lunch theorems for search","author":"D.H.W.","year":"1996","unstructured":"D. H. W. und W. G. Macready. No free lunch theorems for search. Technical report, The Santa Fee Institute, Santa Fee, New Mexico, 1996."}],"container-title":["Informatik aktuell","Informatik 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-58322-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T03:31:18Z","timestamp":1554003078000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-58322-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678809","9783642583223"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-58322-3_8","relation":{},"ISSN":["1431-472X"],"issn-type":[{"type":"print","value":"1431-472X"}],"subject":[],"published":{"date-parts":[[2000]]}}}