1093 search results - page 40 / 219 » Probabilistic Location and Routing |
SIGCOMM
2005
ACM
14 years 2 months ago
2005
ACM
This paper introduces a lightweight, scalable and accurate framework, called Meridian, for performing node selection based on network location. The framework consists of an overla...
GRID
2007
Springer
13 years 8 months ago
2007
Springer
In the facility location problem (FLP) we are given a set of facilities and a set of clients, each of which is to be served by one facility. The goal is to decide which subset of f...
GLOBECOM
2008
IEEE
13 years 9 months ago
2008
IEEE
Abstract—We present a novel routing approach for multichannel cognitive radio networks (CRNs). Our approach is based on probabilistically estimating the available capacity of eve...
PODC
2006
ACM
14 years 2 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
PODC
2005
ACM
14 years 2 months ago
2005
ACM
We consider four problems on distance estimation and object location which share the common flavor of capturing global information via informative node labels: low-stretch routin...