14518 search results - page 2771 / 2904 » Two Problems for Sophistication |
FOCS
1992
IEEE
14 years 2 months ago
1992
IEEE
Wait-free implementations of shared objects tolerate the failure of processes, but not the failure of base objects from which they are implemented. We consider the problem of imple...
PODC
1994
ACM
14 years 2 months ago
1994
ACM
The notion of belief has been useful in reasoning about authentication protocols. In this paper, we show how the notion of belief can be applied to reasoning about cache coherence...
STOC
1993
ACM
14 years 2 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
WG
1994
Springer
14 years 2 months ago
1994
Springer
The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is as...
NIXDORF
1992
14 years 2 months ago
1992
We present some quantitative performance measurements for the computing power of Programmable Active Memories (PAM), as introduced by [2]. Based on Field Programmable Gate Array (...