Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Design and validation of computer protocols
Design and validation of computer protocols
Efficient memory-bounded search methods
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
A fast randomized LOGSPACE algorithm for graph connectivity
ICALP '94 Selected papers from the 21st international colloquium on Automata, languages and programming
A spectrum of time-space trade-offs for undirected s-tconnectivity
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
An Analysis of Bitstate Hashing
Formal Methods in System Design
Membership in Constant Time and Almost-Minimum Space
SIAM Journal on Computing
Directed explicit model checking with HSF-SPIN
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Enhanced Iterative-Deepening Search
IEEE Transactions on Pattern Analysis and Machine Intelligence
Limits and possibilities of sequential hashing with supertrace
FORTE XI / PSTV XVIII '98 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XI) and Protocol Specification, Testing and Verification (PSTV XVIII)
Fast recursive formulations for best-first search that allow controlled use of memory
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Divide-and-conquer bidirectional search: first results
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
Journal of Experimental Algorithmics (JEA)
Taming numbers and durations in the model checking integrated planning system
Journal of Artificial Intelligence Research
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
| Hi-index | 0.01 |
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.