1511 search results - page 126 / 303 » Randomness, lowness and degrees |
157
click to vote
ISCC
2000
IEEE
15 years 10 months ago
2000
IEEE
We consider the adaptation of random early detection (RED) as a buffer management algorithm for TCP traffic in Internet gateways where different maximum transfer units (MTUs) are ...
180
click to vote
CLEIEJ
2006
15 years 6 months ago
2006
The proposed software technique is a very low cost and an effective solution towards designing Byzantine fault tolerant computing application systems that are not so safety critic...
170
click to vote
WIOPT
2010
IEEE
15 years 4 months ago
2010
IEEE
—It has been shown that the well-known cutset bounds can be achieved for deterministic wireless networks by performing random coding at each intermediate node. The complexity and...
155
click to vote
WAOA
2005
Springer
15 years 11 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...
155
click to vote
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
The tremendous growth of public interest in peer-to-peer systems in recent years has initiated a lot of research work on how to design efficient and robust overlay networks for t...