2996 search results - page 373 / 600 » Numberings and Randomness |
223
click to vote
SIGMETRICS
2009
ACM
16 years 1 months ago
2009
ACM
Disseminating a piece of information, or updates for a piece of information, has been shown to benefit greatly from simple randomized procedures, sometimes referred to as gossipi...
168
Voted
WAOA
2005
Springer
16 years 5 days ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
189
click to vote
ESA
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
190
click to vote
ACMICEC
2003
ACM
15 years 12 months ago
2003
ACM
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
193
click to vote
TAMC
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...