376 search results - page 10 / 76 » Self-Stabilizing Graph Protocols |
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
The problem considered in the present article is optimal design of network topologies in multi-agent systems in order to make communication on the network as efficient as possible ...
PERCOM
2005
ACM
14 years 7 months ago
2005
ACM
When analyzing dissemination protocols in mobile adhoc networks the underlying mobility model is an important factor because it strongly influences the performance of these protoc...
CAV
2008
Springer
13 years 9 months ago
2008
Springer
We show how to view certain subclasses of (single-pushout) graph transformation systems as well-structured transition systems, which leads to decidability of the covering problem v...
TCC
2007
Springer
14 years 1 months ago
2007
Springer
We prove a computational soundness theorem for symmetric-key encryption protocols that can be used to analyze security against adaptively corrupting adversaries (that is, adversar...
CHARME
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. We propose new, tractably (in some cases provably) efficient algorithmic methods for exact (sound and complete) parameterized reasoning about cache coherence protocols. F...