90 search results - page 15 / 18 » Fault-tolerant graphs for tori |
HPCC
2009
Springer
13 years 5 months ago
2009
Springer
Abstract--The Grid is an heterogeneous and dynamic environment which enables distributed computation. This makes it a technology prone to failures. Some related work uses replicati...
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database...
RANDOM
1998
Springer
13 years 12 months ago
1998
Springer
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
SIAMDM
2010
13 years 6 months ago
2010
Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs betwee...
SPAA
2003
ACM
14 years 27 days ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...