1591 search results - page 144 / 319 » Random lifts of graphs |
157
click to vote
TSP
2008
15 years 6 months ago
2008
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...
170
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
176
click to vote
SLS
2009
Springer
16 years 1 months ago
2009
Springer
Stochastic local search algorithms can now successfully solve MAXSAT problems with thousands of variables or more. A key to this success is how effectively the search can navigate...
165
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—Information dissemination in a large network is typically achieved when each user shares its own information or resources with each other user. Consider n users randomly located...
171
click to vote
ISAAC
2005
Springer
15 years 12 months ago
2005
Springer
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...