280 search results - page 1 / 56 » Storage Alternatives for Large Structured State Spaces |
CPE
1997
Springer
13 years 11 months ago
1997
Springer
We consider the problem of storing and searching a large state space obtained from a high-level model such as a queueing network or a Petri net. After reviewing the traditional te...
SPIN
2009
Springer
14 years 2 months ago
2009
Springer
Existing techniques for approximate storage of visited states in a model checker are too special-purpose and too DRAM-intensive. Bitstate hashing, based on Bloom filters, is good ...
FLAIRS
2003
13 years 8 months ago
2003
In our previous research, we investigated the properties of case-based plan recognition with incomplete plan libraries. Incremental construction of plan libraries along with retri...
ACSC
2002
IEEE
14 years 12 days ago
2002
IEEE
Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments against widespread usage of the structure is its spac...
DDECS
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract: Bisimulations in general are a powerful concept to minimize large finite state systems regarding some well-defined observational behavior. In contrast to strong bisimul...