Skip to main content
SpringerLink
Log in

Theory and Practice of Time-Space Trade-Offs in Memory Limited Search

  • Conference paper
  • First Online:
KI 2001: Advances in Artificial Intelligence (KI 2001)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2174))

Included in the following conference series:

Abstract

Having to cope with memory limitations is an ubiquitous issue in heuristic search. We present theoretical and practical results on new variants for exploring state-space with respect to memory limitations.

We establish O(log n) minimum-space algorithms that omit both the open and the closed list to determine the shortest path between every two nodes and study the gap in between full memorization in a hash table and the information-theoretic lower bound. The proposed structure of suffix-lists elaborates on a concise binary representation of states by applying bit-state hashing techniques. Significantly more states can be stored while searching and inserting n items into suffix lists is still available in O(n log n) time. Bit-state hashing leads to the new paradigm of partial iterative-deepening heuristic search, in which full exploration is sacrificed for a better detection of duplicates in large search depth.We give first promising results in the application area of communication protocols.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

  1. A. Brodnik and J. Munro. Membership in constant time and almost-minimum space. SIAM, 28(3):1627–1640, 1999.

    MATH  MathSciNet  Google Scholar 

  2. Y. Choueka, Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 2000.

    Google Scholar 

  3. J. C. Culberson and J. Schaeffer. Searching with pattern databases. Lecture Notes in Computer Science, pages 402–416. Springer, 1996.

    Google Scholar 

  4. J. Eckerle and T. Lais. Limits and possibilities of sequential hashing with supertrace. In IFIP FORTE/PSTV, Lecture Notes in Computer Science. Springer, 1998.

    Google Scholar 

  5. S. Edelkamp. Planning with pattern databases. In European Conference on Planning (ECP), 2001. To appear.

    Google Scholar 

  6. S. Edelkamp, A. Lluch-Lafuente, and S. Leue. Directed model-checking in HSF-SPIN. In SPIN Workshop, Lecture Notes in Computer Science, pages 57–79. Springer, 2001.

    Google Scholar 

  7. S. Edelkamp, A. Lluch-Lafuente, and S. Leue. Protocol verification with heuristic search. In AAAI-Spring Symposium on Model-based Validation of Intelligence, pages 75–83, 2001.

    Google Scholar 

  8. S. Edelkamp, A. Lluch-Lafuente, and S. Leue. Trail-directed model checking. In Workshop on Software Model Checking. Electronic Notes in Theoretical Computer Science, Elsevier, 2001. To appear.

    Google Scholar 

  9. U. Feige. A fast randomized LOGSPACE algorithm for graph connectivity. Theoretical Computer Science, 169(2):147–160, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  10. U. Feige. A spectrum of time-space tradeoffs for undirected s-t connectivity. Journal of Computer and System Sciences, 54(2):305–316, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  11. G. J. Holzmann. Design and Validation of Computer Protocols. Prentice-Hall, Englewood Cliffs, New Jersey, 1991.

    Google Scholar 

  12. G. J. Holzmann. An analysis of bitstate hashing. Formal Methods in System Design: An International Journal, 13(3):289–307, 1998.

    Article  MathSciNet  Google Scholar 

  13. F. Hüffner, S. Edelkamp, H. Fernau, and R. Niedermeier. Finding optimal solutions toAtomix. This volume.

    Google Scholar 

  14. M. Kamel and S. Leue. Formalization and validation of the general inter-orb protocol (GIOP) using Promela and SPIN. In Software Tools for Technology Transfer, volume 2, pages 394–409, 2000.

    Article  MATH  Google Scholar 

  15. R. E. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1):97–109, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  16. R. E. Korf. Divide-and-conquer bidirectional search: First results. In IJCAI, pages 1184–1189, 1999.

    Google Scholar 

  17. A. Reinefeld and T. Marsland. Enhanced iterative-deepening search. IEEE Transactions on Pattern Analysis and Machine Intelligence, 16(7):701–710, 1994.

    Article  Google Scholar 

  18. S. Russell. Efficient memory-bounded search methods. In ECAI-92, pages 1–5, 1992.

    Google Scholar 

  19. W. J. Savitch. Relationships between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences, 4(2):177–192, 1970.

    MATH  MathSciNet  Google Scholar 

  20. A. K. Sen and A. Bagchi. Fast recursive formulations for best-first search that allowcontrolled use of memory. In IJCAI, pages 297–302, 1989.

    Google Scholar 

  21. U. Stern and D. L. Dill. Combining state space caching and hash compaction. In Methoden des Entwurfs und der Verifikation digitaler Systeme, 4. GI/ITG/GME Workshop, pages 81–90. Shaker Verlag, Aachen, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Max-Plank-Institut für Informatik, Stuhlsatzenhausenweg 85, 66123, Saarbrücken, Germany

    Stefan Edelkamp

  2. Georges-Köhler-Allee, Institut für Informatik, Geb. 51, 79110, Freiburg, Germany

    Ulrich Meyer

Authors
  1. Stefan Edelkamp
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ulrich Meyer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. RWTH Aachen, Theoretical Computer Science, Ahornstrasse 55, 52074, Aachen, Germany

    Franz Baader

  2. Intelligent Systems Department, University of Leipzig, Computer Science Institute, Augustusplatz 10-11, 04109, Leipzig, Germany

    Gerhard Brewka

  3. Institute of Information Systems Knowledge-Based Systems Group, Vienna University of Technology, Favoritenstrasse 11, 1040, Wien, Austria

    Thomas Eiter

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Edelkamp, S., Meyer, U. (2001). Theory and Practice of Time-Space Trade-Offs in Memory Limited Search. In: Baader, F., Brewka, G., Eiter, T. (eds) KI 2001: Advances in Artificial Intelligence. KI 2001. Lecture Notes in Computer Science(), vol 2174. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45422-5_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-45422-5_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42612-7

  • Online ISBN: 978-3-540-45422-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation