505 search results - page 7 / 101 » On the Minimality and Decomposability of Constraint Networks |
PODC
2006
ACM
14 years 2 months ago
2006
ACM
A quorum system over a universe of logical elements is a collection of subsets (quorums) of elements, any two of which intersect. In numerous distributed algorithms, the elements ...
JPDC
2007
13 years 8 months ago
2007
This paper discusses algorithmic and implementation aspects of a distributed remote visualization system that optimally decomposes and adaptively maps the visualization pipeline t...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
—The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
CIC
2006
13 years 9 months ago
2006
A shared secret, conference key, must be established among members to securely communicate among them. The Diffie-Hellman is often used for the conference key establishment. In a ...