1612 search results - page 85 / 323 » Analysing Randomized Distributed Algorithms |
116
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
104
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
Recently, studies with the XCS classifier system on Boolean functions have shown that in certain types of functions simple crossover operators can lead to disruption and, conseque...
136
Voted
KDD
2009
ACM
16 years 2 months ago
2009
ACM
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
142
click to vote
WSNA
2003
ACM
15 years 7 months ago
2003
ACM
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
128
click to vote
INFOCOM
2005
IEEE
15 years 7 months ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...