Sciweavers

1388 search results - page 102 / 278
» Approximability of Robust Network Design
Sort
View
IPL
2011
63views more  IPL 2011»
13 years 4 months ago
Edge-colored graphs with applications to homogeneous faults
In this paper, we use the concept of edge-colored graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirement...
Yongge Wang, Yvo Desmedt
GECCO
2009
Springer
14 years 4 months ago
An evolutionary approach to planning IEEE 802.16 networks
Efficient and effective deployment of IEEE 802.16 networks to service an area of users with certain traffic demands is an important network planning problem. We resort to an evol...
Ting Hu, Yuanzhu Peter Chen, Wolfgang Banzhaf, Rob...
IPSN
2004
Springer
14 years 3 months ago
Locally constructed algorithms for distributed computations in ad-hoc networks
In this paper we develop algorithms for distributed computation of a broad range of estimation and detection tasks over networks with arbitrary but fixed connectivity. The distri...
Dzulkifli S. Scherber, Haralabos C. Papadopoulos
INFOCOM
2012
IEEE
12 years 4 days ago
Submodular game for distributed application allocation in shared sensor networks
Abstract—Wireless sensor networks are evolving from singleapplication platforms towards an integrated infrastructure shared by multiple applications. Given the resource constrain...
Chengjie Wu, You Xu, Yixin Chen, Chenyang Lu
ICDM
2008
IEEE
230views Data Mining» more  ICDM 2008»
14 years 4 months ago
Clustering Distributed Time Series in Sensor Networks
Event detection is a critical task in sensor networks, especially for environmental monitoring applications. Traditional solutions to event detection are based on analyzing one-sh...
Jie Yin, Mohamed Medhat Gaber