376 search results - page 26 / 76 » Self-Stabilizing Graph Protocols |
131
click to vote
PERCOM
2008
ACM
15 years 11 months ago
2008
ACM
In this paper we present a protocol for sensor applications that require periodic collection of raw data reports from the entire network in a timely manner. We formulate the probl...
161
click to vote
FASE
2005
Springer
15 years 10 months ago
2005
Springer
Modeling the dependencies between provided and required services within a software component is necessary for several reasons, such as automated component adaptation and architectu...
176
click to vote
CCCG
2010
15 years 6 months ago
2010
A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...
160
click to vote
ALENEX
2003
15 years 6 months ago
2003
Graph models for real-world complex networks such as the Internet, the WWW and biological networks are necessary for analytic and simulation-based studies of network protocols, al...
145
Voted
COMBINATORICS
2007
15 years 5 months ago
2007
We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince a refe...