Sciweavers

15 search results - page 2 / 3
» Trade-offs on the location of the core node in a network
Sort
View
SIGMETRICS
2002
ACM
142views Hardware» more  SIGMETRICS 2002»
13 years 5 months ago
Probabilistic scalable P2P resource location services
Scalable resource discovery services form the core of directory and other middleware services. Scalability requirements preclude centralized solutions. The need to have directory ...
Daniel A. Menascé, Lavanya Kanchanapalli
MDM
2009
Springer
299views Communications» more  MDM 2009»
13 years 12 months ago
Aggregate Location Monitoring for Wireless Sensor Networks: A Histogram-Based Approach
Location monitoring systems are used to detect human activities and provide monitoring services, e.g., aggregate queries. In this paper, we consider an aggregate location monitori...
Chi-Yin Chow, Mohamed F. Mokbel, Tian He
WADS
1997
Springer
88views Algorithms» more  WADS 1997»
13 years 9 months ago
Finding Cores of Limited Length
In this paper we consider the problem of nding a core of limited length in a tree. A core is a path, which minimizes the sum of the distances to all nodes in the tree. This proble...
Stephen Alstrup, Peter W. Lauridsen, Peer Sommerlu...
HM
2007
Springer
137views Optimization» more  HM 2007»
13 years 11 months ago
A Hybrid VNS for Connected Facility Location
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
Ivana Ljubic
ICC
2007
IEEE
13 years 11 months ago
Speed Up Queries in Unstructured Peer-to-Peer Networks
—Unstructured peer-to-peer networks have gained a lot of popularity due to their resilience to network dynamics. The core operation in such networks is to efficiently locate res...
Zhan Zhang, Yong Tang, Shigang Chen