Sciweavers

1941 search results - page 105 / 389
» On Generalizations of Network Design Problems with Degree Bo...
Sort
View
RTSS
2006
IEEE
15 years 4 months ago
Modeling and Worst-Case Dimensioning of Cluster-Tree Wireless Sensor Networks
Time-sensitive Wireless Sensor Network (WSN) applications require finite delay bounds in critical situations. This paper provides a methodology for the modeling and the worst-case...
Anis Koubaa, Mário Alves, Eduardo Tovar
SIGMETRICS
2009
ACM
149views Hardware» more  SIGMETRICS 2009»
15 years 4 months ago
On the treeness of internet latency and bandwidth
Existing empirical studies of Internet structure and path properties indicate that the Internet is tree-like. This work quantifies the degree to which at least two important Inte...
Venugopalan Ramasubramanian, Dahlia Malkhi, Fabian...
IWCMC
2006
ACM
15 years 3 months ago
On the robustness of grid-based deployment in wireless sensor networks
Grid-based sensor deployment is an effective and efficient practice for provisioning wireless sensor networks. Previous work has addressed grid-based deployment of sensors in orde...
Kenan Xu, Glen Takahara, Hossam S. Hassanein
GECCO
2008
Springer
141views Optimization» more  GECCO 2008»
14 years 11 months ago
A study of NK landscapes' basins and local optima networks
We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces [5]. We use the well-known fami...
Gabriela Ochoa, Marco Tomassini, Sébastien ...
STOC
2003
ACM
96views Algorithms» more  STOC 2003»
15 years 10 months ago
Optimal oblivious routing in polynomial time
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...
Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, H...