Results 211 to 220 of about 26,431 (256)
Equations for Asynchronous Message Passing [PDF]
Fundamenta Informaticae, 2013 First, fixed-point equations specifying synchronous communication in distributed systems are recalled. Their solution could be represented by Petri net-like structures where net-places represent agents and transitions represent transfers of messages.
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
1995
We present a new solution of the mutual exclusion problem, which is modelled as a Petri net. In order to present a concise model of the algorithm, we extend Petri nets by the concepts of progress and non-progress transitions and fair arcs.
Ekkart Kindler, Rolf Walter
openaire +1 more source
We present a new solution of the mutual exclusion problem, which is modelled as a Petri net. In order to present a concise model of the algorithm, we extend Petri nets by the concepts of progress and non-progress transitions and fair arcs.
Ekkart Kindler, Rolf Walter
openaire +1 more source
A Syntactic Theory of Message Passing
Journal of the ACM, 1980Recent developments by Hewitt and others have stimulated interest in message-passing constructs as an alternative to the more conventional applicative semantics on which most current languages are based. The present work illuminates the distinction between applicative and message-passing semantics by means of the μ -
Stephen A. Ward, Robert H. Halstead Jr.
openaire +2 more sources
Reparameterization Gradient Message Passing
2019 27th European Signal Processing Conference (EUSIPCO), 2019In this paper we consider efficient message passing based inference in a factor graph representation of a probabilistic model. Current message passing methods, such as belief propagation, variational message passing or expectation propagation, rely on analytically pre-computed message update rules.
Akbayrak, Semih, de Vries, Bert
openaire +1 more source
Journal of Parallel and Distributed Computing, 1997
Replacing traditional operating systems communication implementations with customized implementations increases the performance of parallel and distributed applications. This paper describes the design and implementation of customizable message passing systems.
openaire +1 more source
Replacing traditional operating systems communication implementations with customized implementations increases the performance of parallel and distributed applications. This paper describes the design and implementation of customizable message passing systems.
openaire +1 more source
An overview of message passing environments
Parallel Computing, 1994zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oliver A Mcbryan
exaly +3 more sources
Hybrid Approximate Message Passing
IEEE Transactions on Signal Processing, 2017 Gaussian and quadratic approximations of message passing algorithms on graphs have attracted considerable recent attention due to their computational simplicity, analytic tractability, and wide applicability in optimization and statistical inference problems. This paper presents a systematic framework for incorporating such approximate message passing (
Sundeep Rangan +2 more
exaly +4 more sources
Proceedings of the 8th Annual Collaboration, Electronic messaging, Anti-Abuse and Spam Conference, 2011
In this paper we introduce the concept of Message Keys by proposing that their function is similar to that of an employee's security pass in that they identify legitimate messages. We describe numerous types and forms of keys, their usage, advantages and disadvantages.
openaire +1 more source
In this paper we introduce the concept of Message Keys by proposing that their function is similar to that of an employee's security pass in that they identify legitimate messages. We describe numerous types and forms of keys, their usage, advantages and disadvantages.
openaire +1 more source
Passing Messages to Lonely Numbers
Computing in Science & Engineering, 2008Message-passing methods provide powerful approximation algorithms for problems that can be formulated in terms of (probabilistic) graphical models. These methods find applications in statistical physics, inference, and combinatorial optimization. Sudoku, a popular number puzzle, is a simple optimization problem that message-passing algorithms can help ...
openaire +2 more sources
Nursing standard (Royal College of Nursing (Great Britain) : 1987), 2011
Babies who are born to young mothers, particularly those in disadvantaged groups, are more likely to have adverse outcomes, including cot death. A novel scheme is attempting to address the problem.
openaire +3 more sources
Babies who are born to young mothers, particularly those in disadvantaged groups, are more likely to have adverse outcomes, including cot death. A novel scheme is attempting to address the problem.
openaire +3 more sources