62 search results - page 6 / 13 » A Self-stabilizing K-Clustering Algorithm Using an Arbitrary... |
GLOBECOM
2008
IEEE
14 years 5 months ago
2008
IEEE
Abstract—We develop and evaluate a new method for estimating and optimizing various performance metrics for multihop wireless networks, including MANETs. We introduce an approxim...
FSTTCS
2008
Springer
13 years 12 months ago
2008
Springer
ABSTRACT. We introduce a novel approach to the runtime monitoring of complex system properties. In particular, we present an online algorithm for a safety fragment of metric first...
SODA
2001
ACM
14 years 7 days ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
ESA
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. Social networks are navigable small worlds, in which two arbitrary people are likely connected by a short path of intermediate friends that can be found by a "decent...
SIGMETRICS
2012
ACM
12 years 1 months ago
2012
ACM
Latency has become an important metric for network monitoring since the emergence of new latency-sensitive applications (e.g., algorithmic trading and high-performance computing)....