Sciweavers

8780 search results - page 1343 / 1756
» On the Feasibility of Consistent Computations
Sort
View
RTCSA
1998
IEEE
15 years 11 months ago
Wait-Free Snapshots in Real-Time Systems: Algorithms and Performance
Snap-shot mechanisms are used to read a globally consistent set of variable values. Such a mechanism can be used to solve a variety of communication and synchronization problems, ...
Andreas Ermedahl, Hans Hansson, Marina Papatrianta...
ISCA
1997
IEEE
137views Hardware» more  ISCA 1997»
15 years 11 months ago
VM-Based Shared Memory on Low-Latency, Remote-Memory-Access Networks
Recent technological advances have produced network interfaces that provide users with very low-latency access to the memory of remote machines. We examine the impact of such netw...
Leonidas I. Kontothanassis, Galen C. Hunt, Robert ...
TIME
1994
IEEE
15 years 11 months ago
An Algebraic Formulation of Temporal Knowledge for Reasoning about Recurring Events
We formulate an algebra of binary temporal relations between events the number of occurrences of which is unknown, but which are known to recur in time. Ontologically, we view the...
Robert A. Morris, William D. Shoaff, Lina Khatib
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 11 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
STOC
1993
ACM
123views Algorithms» more  STOC 1993»
15 years 11 months ago
Constructing small sample spaces satisfying given constraints
Abstract. The subject of this paper is nding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certa...
Daphne Koller, Nimrod Megiddo
« Prev « First page 1343 / 1756 Last » Next »