Sciweavers

1765 search results - page 259 / 353
» Communication Scheduling
Sort
View
IJDSN
2007
111views more  IJDSN 2007»
14 years 11 months ago
Architecture of Wireless Sensor Networks with Mobile Sinks: Multiple Access Case
We propose to develop wireless Sensor Networks with Mobile Sinks (MSSN), under high sensor node density, where multiple sensor nodes need to share one single communication channel...
Liang Song, Dimitrios Hatzinakos
INFSOF
1998
110views more  INFSOF 1998»
14 years 11 months ago
Active help found beneficial in wizard of oz study
Emerging AI techniques will make possible new intelligent help features, such as ‘active help’ (interrupting the user when appropriate) and ‘back channel’ communication (a...
J. S. Davis
CORR
2010
Springer
163views Education» more  CORR 2010»
14 years 10 months ago
Faster Algorithms for Semi-Matching Problems
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...
Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon...
IPSN
2010
Springer
14 years 9 months ago
i-MAC - a MAC that learns
Traffic patterns in manufacturing machines exhibit strong temporal correlations due to the underlying repetitive nature of their operations. A MAC protocol can potentially learn t...
Krishna Kant Chintalapudi
SIAMCOMP
2010
97views more  SIAMCOMP 2010»
14 years 6 months ago
Lower Bounds for Randomized Consensus under a Weak Adversary
This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the prob...
Hagit Attiya, Keren Censor-Hillel