658 search results - page 32 / 132 » Lower bounds for sorting networks |
ESA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. The throughput capacity of arbitrary wireless networks under the physical Signal to Interference Plus Noise Ratio (SINR) model has received a greater deal of attention in...
OPODIS
2007
13 years 9 months ago
2007
Abstract. In small-world networks, each peer is connected to its closest neighbors in the network topology, as well as to additional long-range contact(s), also called shortcut(s)....
JSAC
2006
13 years 7 months ago
2006
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
SIROCCO
2004
13 years 9 months ago
2004
A black hole is a harmful host that destroys incoming agents without leaving any observable trace of such a destruction. The black hole search problem is to unambiguously determine...
SPAA
2009
ACM
14 years 8 months ago
2009
ACM
In a max-min LP, the objective is to maximise subject to Ax 1, Cx 1, and x 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorith...