3394 search results - page 414 / 679 » A Modal Model of Memory |
159
click to vote
ACSD
2005
IEEE
16 years 8 days ago
2005
IEEE
We introduce and study problems of distributed observation with bounded or unbounded memory. We are given a system modeled as a finite-word language L over some finite alphabet ...
162
click to vote
FSTTCS
2005
Springer
16 years 5 days ago
2005
Springer
We introduce asynchronous dynamic pushdown networks (ADPN), a new model for multithreaded programs in which pushdown systems communicate via shared memory. ADPN generalizes both CP...
143
click to vote
PADS
2004
ACM
16 years 2 days ago
2004
ACM
In optimistic simulations, checkpointing techniques are often used to reduce the overhead caused by state saving. In this paper, we propose event reconstruction as a technique wit...
167
click to vote
ESA
1998
Springer
15 years 11 months ago
1998
Springer
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
213
click to vote
ICCD
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper we propose techniques to dynamically downsize or upsize a cache accompanied by cache set/line shutdown to produce efficient caches. Unlike previous approaches, resiz...