1612 search results - page 179 / 323 » Analysing Randomized Distributed Algorithms |
146
click to vote
WALCOM
2010
IEEE
15 years 28 days ago
2010
IEEE
In a distributed computing environment a faulty node could lead other nodes in the system to behave in a faulty manor. An initial set of faults could make all the nodes in the syst...
127
Voted
GROUP
2010
ACM
15 years 17 days ago
2010
ACM
Consistency maintenance (CM) techniques are a crucial part of many distributed systems, and are particularly important in networked games. In this paper we describe a framework of...
119
Voted
ICML
2006
IEEE
16 years 3 months ago
2006
IEEE
In recent years, there has been a proliferation of theoretical graph models, e.g., preferential attachment and small-world models, motivated by real-world graphs such as the Inter...
110
Voted
COMPLEX
2009
Springer
15 years 9 months ago
2009
Springer
—In this paper we study the network structure in music and attempt to compose music artificially. Networks are constructed with nodes and edges corresponding to musical notes an...
112
Voted
APPROX
2004
Springer
15 years 8 months ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...