1612 search results - page 230 / 323 » Analysing Randomized Distributed Algorithms |
103
click to vote
JPDC
2008
15 years 2 months ago
2008
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
106
click to vote
SPAA
2010
ACM
15 years 7 months ago
2010
ACM
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
138
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
The effects of neutrality on evolutionary search have been considered in a number of interesting studies, the results of which, however, have been contradictory. Some researchers ...
100
click to vote
STOC
2007
ACM
16 years 2 months ago
2007
ACM
We investigate balls-and-bins processes where m weighted balls are placed into n bins using the "power of two choices" paradigm, whereby a ball is inserted into the less...
125
click to vote
ICDM
2009
IEEE
15 years 9 months ago
2009
IEEE
—Document networks, i.e., networks associated with text information, are becoming increasingly popular due to the ubiquity of Web documents, blogs, and various kinds of online da...