2084 search results - page 314 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
We consider the setting of a multiprocessor where the speeds of the m processors can be individually scaled. Jobs arrive over time and have varying degrees of parallelizability. A...
MST
2010
14 years 8 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
WADS
2007
Springer
15 years 4 months ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— Recent advances in network coding have shown great potential for efficient information multicasting in communication networks, in terms of both network throughput and network ...
WAW
2007
Springer
15 years 4 months ago
2007
Springer
A random graph model based on Kronecker products of probability matrices has been recently proposed as a generative model for large-scale real-world networks such as the web. This...