194 search results - page 11 / 39 » Gathering Algorithms on Paths Under Interference Constraints |
DSN
2011
IEEE
12 years 7 months ago
2011
IEEE
—As process technology shrinks devices, circuits experience accelerated wearout. Monitoring wearout will be critical for improving the efficiency of error detection and correctio...
ALGORITHMICA
2010
13 years 7 months ago
2010
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
GLOBECOM
2007
IEEE
13 years 9 months ago
2007
IEEE
—In this contribution, the Fisher-Bingham-5 (FB5) probability density function (pdf) is used to model the shape of the direction power spectral density function (psdf) of individ...
TCOM
2010
13 years 6 months ago
2010
Dynamic spectrum access (DSA) is an integral part of cognitive radio technology aiming at efficient management of the available power and bandwidth resources. The present paper d...
IJCAI
1997
13 years 9 months ago
1997
This paper studies constraint satisfaction over connected row-convex (CRC) constraints. It shows that CRC constraints are closed under composition, intersection, and transposition...