In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
Mark H. Nodine, Michael T. Goodrich, Jeffrey Scott...
Many problems in high assurance systems design are only tractable using computationally expensive search algorithms. For these algorithms to be useful, designers must be provided ...
Simon M. Poulding, Paul Emberson, Iain Bate, John ...
We develop a memory-efficient off-line algorithm for the enumeration of global states of a distributed computation. The algorithm allows the parameterization of its memory requir...
This paper presents SHIRI-Querying 3 , an approach for semantic search on semi-structured documents. We propose a solution to tackle incompleteness and imprecision of semantic anno...
In this paper we investigate the design and analysis of algorithms resilient to memory faults. We focus on algorithms that, despite the corruption of some memory values during the...