69 search results - page 5 / 14 » How robust are average complexity measures |
GLOBECOM
2007
IEEE
14 years 4 months ago
2007
IEEE
—Comprehensive performance analysis of the unordered V-BLAST algorithm with various power allocation strategies is presented, which makes use of analytical tools and resorts to M...
IM
2007
13 years 11 months ago
2007
Abstract—We investigate the use of gossip protocols for continuous monitoring of network-wide aggregates under crash failures. Aggregates are computed from local management varia...
IPSN
2007
Springer
14 years 4 months ago
2007
Springer
Sensor location information is a prerequisite to the utility of most sensor networks. In this paper we present a robust and low-complexity algorithm to self-localize and orient se...
HPDC
2005
IEEE
14 years 3 months ago
2005
IEEE
Scheduling strategies for parallel and distributed computing have mostly been oriented toward performance, while striving to achieve some notion of fairness. With the increase in ...
IMC
2003
ACM
14 years 3 months ago
2003
ACM
In this paper, we consider the problem of how to represent the locations of Internet hosts in a Cartesian coordinate system to facilitate estimate of the network distance between ...