6251 search results - page 1028 / 1251 » Randomness, Computability, and Density |
132
click to vote
WAOA
2005
Springer
15 years 10 months 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...
141
click to vote
ESA
2004
Springer
15 years 10 months 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 ...
137
click to vote
INFOCOM
2003
IEEE
15 years 9 months ago
2003
IEEE
Abstract— One key component of recent pricing-based congestion control schemes is an algorithm for probabilistically setting the Explicit Congestion Notification bit at routers ...
149
click to vote
ACMICEC
2003
ACM
15 years 9 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 ...
160
Voted
TAMC
2010
Springer
15 years 9 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. ...