2252 search results - page 115 / 451 » Lower Bounds for Dynamic Algorithms |
116
click to vote
CLUSTER
2001
IEEE
15 years 7 months ago
2001
IEEE
Using multiple independent networks (also known as rails) is an emerging technique to overcome bandwidth limitations and enhance fault tolerance of current high-performance parall...
130
click to vote
NETWORKING
2004
15 years 4 months ago
2004
We consider the problem of traffic grooming in WDM ring networks. Previous studies have focused on minimizing aggregate representations of the network cost. In this work, we consid...
142
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
154
click to vote
CPAIOR
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
141
click to vote
CN
2011
14 years 10 months ago
2011
—In multi-hour network design, periodic traffic variations along time are considered in the dimensioning process. Then, the non coincidence of traffic peaks along the day or the ...