Sciweavers

1414 search results - page 278 / 283
» Performance Bounds in Communication Networks with Variable-R...
Sort
View
SIROCCO
2000
13 years 8 months ago
Cooperative computing with fragmentable and mergeable groups
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...
Chryssis Georgiou, Alexander A. Shvartsman
TSP
2008
120views more  TSP 2008»
13 years 7 months ago
Distributed Average Consensus With Dithered Quantization
In this paper, we develop algorithms for distributed computation of averages of the node data over networks with bandwidth/power constraints or large volumes of data. Distributed ...
Tuncer C. Aysal, Mark Coates, Michael Rabbat
ALGORITHMICA
1998
184views more  ALGORITHMICA 1998»
13 years 7 months ago
Approximation Algorithms for Connected Dominating Sets
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
Sudipto Guha, Samir Khuller
SIAMCO
2010
147views more  SIAMCO 2010»
13 years 5 months ago
Anytime Reliable Transmission of Real-Valued Information through Digital Noisy Channels
Abstract. The problem of reliably transmitting a real-valued random vector through a digital noisy channel is relevant for the design of distributed estimation and control techniqu...
Giacomo Como, Fabio Fagnani, Sandro Zampieri
IEICET
2007
93views more  IEICET 2007»
13 years 7 months ago
Experimental Evaluation of Decision Criteria for WLAN Handover: Signal Strength and Frame Retransmission
Abstract. In ubiquitous networks, Mobile Nodes (MNs) may often suffer from performance degradation due to the following two reasons: (1) reduction of signal strength by an MN’s m...
Kazuya Tsukamoto, Takeshi Yamaguchi, Shigeru Kashi...