Sciweavers

298 search results - page 22 / 60
» Multicriteria Steiner Tree Problem for Communication Network
Sort
View
GI
2007
Springer
15 years 6 months ago
On Sensor Scheduling in Case of Unreliable Communication
: This paper deals with the linear discrete-time sensor scheduling problem in unreliable communication networks. In case of the common assumption of an errorfree communication, the...
Marco F. Huber, Eric Stiegeler, Uwe D. Hanebeck
INFOCOM
2010
IEEE
14 years 9 months ago
On Computing Compression Trees for Data Collection in Wireless Sensor Networks
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
Jian Li, Amol Deshpande, Samir Khuller
SIAMJO
2000
101views more  SIAMJO 2000»
14 years 11 months ago
An Efficient Algorithm for Minimizing a Sum of p-Norms
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
Guoliang Xue, Yinyu Ye
FOCS
1994
IEEE
15 years 4 months ago
On-line Admission Control and Circuit Routing for High Performance Computing and Communication
This paper considers the problems of admission control and virtual circuit routing in high performance computing and communication systems. Admission control and virtual circuit r...
Baruch Awerbuch, Rainer Gawlick, Frank Thomson Lei...
SC
2003
ACM
15 years 5 months ago
Scalable Hardware-Based Multicast Trees
This paper presents an algorithm for implementing optimal hardware-based multicast trees, on networks that provide hardware support for collective communication. Although the prop...
Salvador Coll, José Duato, Fabrizio Petrini...