Sciweavers

317 search results - page 19 / 64
» Snap-Stabilization in Message-Passing Systems
Sort
View
FAST
2009
13 years 7 months ago
Story Book: An Efficient Extensible Provenance Framework
Most application provenance systems are hard coded for a particular type of system or data, while current provenance file systems maintain in-memory provenance graphs and reside i...
Richard P. Spillane, Russell Sears, Chaitanya Yala...
HIPS
1998
IEEE
14 years 2 months ago
Constructive and Adaptable Distributed Shared Memory
Distributed shared memory (DSM) is a paradigm for programming distributed systems, which provides an alternative to the message passing model. DSM offers the agents of the system ...
Jordi Bataller, José M. Bernabéu-Aub...
CORR
2011
Springer
149views Education» more  CORR 2011»
13 years 4 months ago
Solving k-Set Agreement with Stable Skeleton Graphs
In this paper we consider the k-set agreement problem in distributed round-based systems where processes communicate by message passing. We capture the synchrony and reliability o...
Martin Biely, Peter Robinson, Ulrich Schmid
JCIT
2010
126views more  JCIT 2010»
13 years 4 months ago
Development of Low Cost Message Delivery Path for Mobile Agent Communication
The location management ability of a mobile agent system which enables a mobile agent to interact with others accurately by message passing beyond doubts stands important for the ...
Tzong I Wang, Ting-Yuan Yeh
CISS
2010
IEEE
13 years 1 months ago
Unconstrained minimization of quadratic functions via min-sum
—Gaussian belief propagation is an iterative algorithm for computing the mean of a multivariate Gaussian distribution. Equivalently, the min-sum algorithm can be used to compute ...
Nicholas Ruozzi, Sekhar Tatikonda