Sciweavers

Share
CDC
2010
IEEE
152views Control Systems» more  CDC 2010»
8 years 10 months ago
Optimal network topology design in multi-agent systems for efficient average consensus
The problem considered in the present article is optimal design of network topologies in multi-agent systems in order to make communication on the network as efficient as possible ...
Mohammad Rafiee, Alexandre M. Bayen
CORR
2007
Springer
117views Education» more  CORR 2007»
9 years 3 months ago
Sensor Networks with Random Links: Topology Design for Distributed Consensus
—In a sensor network, in practice, the communication among sensors is subject to: 1) errors that can cause failures of links among sensors at random times; 2) costs; and 3) const...
Soummya Kar, José M. F. Moura
WCE
2007
9 years 5 months ago
A Distributed Energy Efficient Query Processing in Self-Organized Wireless Sensor Networks
—Spatial query execution is an essential functionality of a sensor network. Redundancy within a sensor network can be exploited to reduce the communication cost incurred in execu...
Meer A. Hamza, Sherin M. Youssef, Salma F. Fayed
OPODIS
2004
9 years 5 months ago
Fast Localized Delaunay Triangulation
A localized Delaunay triangulation owns the following interesting properties in a wireless ad hoc setting: it can be built with localized information, the communication cost impos...
Filipe Araújo, Luís Rodrigues
APNOMS
2006
Springer
9 years 7 months ago
Information-Driven Task Routing for Network Management in Wireless Sensor Networks
Wireless sensor networks (WSNs) consist of a large collection of small nodes providing collaborative and distributed sensing ability in unpredictable environments. Given their unat...
Yu Liu, Yumei Wang, Lin Zhang, Chan-Hyun Youn
RSP
1998
IEEE
188views Control Systems» more  RSP 1998»
9 years 8 months ago
Performance and Interface Buffer Size Driven Behavioral Partitioning for Embedded Systems
One of the major differences in partitioning for codesign is in the way the communication cost is evaluated. Generally the size of the edge cut-set is used. When communication bet...
T.-C. Lin, Sadiq M. Sait, Walling R. Cyre
IPPS
1998
IEEE
9 years 8 months ago
Jacobi Orderings for Multi-Port Hypercubes
1 The communication cost plays a key role in the performance of many parallel algorithms. In the particular case of the one-sided Jacobi method for symmetric eigenvalue and eigenve...
Dolors Royo, Antonio González, Miguel Valer...
COMPSAC
2002
IEEE
9 years 8 months ago
Parallel Genetic Algorithms with Schema Migration
Genetic algorithms (GAs) are efficient non-gradient stochastic search methods. Parallel GAs are proposed to overcome the deficiencies of sequential GAs, such as low speed and aptn...
Baowen Xu, Yu Guan, Zhenqiang Chen, Karl R. P. H. ...
ICDM
2003
IEEE
112views Data Mining» more  ICDM 2003»
9 years 9 months ago
Privacy-preserving Distributed Clustering using Generative Models
We present a framework for clustering distributed data in unsupervised and semi-supervised scenarios, taking into account privacy requirements and communication costs. Rather than...
Srujana Merugu, Joydeep Ghosh
IPTPS
2004
Springer
9 years 9 months ago
Comparing the Performance of Distributed Hash Tables Under Churn
A protocol for a distributed hash table (DHT) incurs communication costs to keep up with churn—changes in membership—in order to maintain its ability to route lookups efficie...
Jinyang Li, Jeremy Stribling, Thomer M. Gil, Rober...
books