Sciweavers

995 search results - page 116 / 199
» Minimizing Congestion in General Networks
Sort
View
JCO
2010
101views more  JCO 2010»
13 years 6 months ago
Separator-based data reduction for signed graph balancing
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
IWCMC
2009
ACM
14 years 2 months ago
On fault tolerant ad hoc network design
Minimal configuration and quick deployment of ad hoc networks make it suitable for numerous applications such as emergency situations, border monitoring, and military missions, e...
Wasim El-Hajj, Hazem Hajj, Zouheir Trabelsi
QUESTA
2010
131views more  QUESTA 2010»
13 years 6 months ago
Asymptotically optimal parallel resource assignment with interference
Motivated by scheduling in cellular wireless networks and resource allocation in computer systems, we study a service facility with two classes of users having heterogeneous servi...
Maaike Verloop, R. Núñez Queija
MOBISYS
2009
ACM
14 years 8 months ago
SolarStore: enhancing data reliability in solar-powered storage-centric sensor networks
In this paper, we present a reliable storage service, called SolarStore, that adaptively trades-off storage reliability versus energy consumption in solar-powered sensor networks....
Yong Yang, Lili Wang, Dong Kun Noh, Hieu Khac Le, ...
ANCS
2008
ACM
13 years 10 months ago
On design of bandwidth scheduling algorithms for multiple data transfers in dedicated networks
The significance of high-performance dedicated networks has been well recognized due to the rapidly increasing number of large-scale applications that require high-speed data tran...
Yunyue Lin, Qishi Wu