75 search results - page 15 / 15 » Reconfiguration for Fault Tolerance Using Graph Grammars |
SPAA
2003
ACM
13 years 11 months 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...
SIGADA
1999
Springer
13 years 10 months ago
1999
Springer
In this paper we will demonstrate how Ada and its Distributed Annex may be used to relocate concurrent objects in a distributed data ow application. This relocation mechanism will...
PDCAT
2005
Springer
13 years 11 months ago
2005
Springer
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
HPDC
2010
IEEE
13 years 7 months ago
2010
IEEE
iFlow is a replication-based system that can achieve both fast and reliable processing of high volume data streams on the Internet scale. iFlow uses a low degree of replication in...
BMCBI
2010
13 years 1 months ago
2010
Background: The Ensembl project produces updates to its comparative genomics resources with each of its several releases per year. During each release cycle approximately two week...