Sciweavers

10182 search results - page 2037 / 2037
» Case Studies
Sort
View
ECCC
2007
147views more  ECCC 2007»
13 years 5 months ago
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswa...
SENSYS
2010
ACM
13 years 3 months ago
Surviving wi-fi interference in low power ZigBee networks
Frequency overlap across wireless networks with different radio technologies can cause severe interference and reduce communication reliability. The circumstances are particularly...
Chieh-Jan Mike Liang, Bodhi Priyantha, Jie Liu, An...
« Prev « First page 2037 / 2037 Last » Next »