557 search results - page 80 / 112 » Optimization Algorithms for Large Self-Structuring Networks |
SDM
2003
SIAM
14 years 11 hour ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
IPSN
2005
Springer
14 years 4 months ago
2005
Springer
— Many inference problems that arise in sensor networks require the computation of a global conclusion that is consistent with local information known to each node. A large class...
PODC
2010
ACM
14 years 18 days ago
2010
ACM
In this paper, we address the problem of content placement in peer-to-peer systems, with the objective of maximizing the utilization of peers' uplink bandwidth resources. We ...
FOCS
1995
IEEE
14 years 2 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
ICC
2007
IEEE
14 years 5 months ago
2007
IEEE
—Although network-wide flooding in reactive routing protocols like AODV [1] facilitates the discovery of optimal routes, they engender large control overhead. Some efficient floo...