Sciweavers

709 search results - page 105 / 142
» coordination 2010
Sort
View
CORR
2010
Springer
122views Education» more  CORR 2010»
15 years 2 months ago
How to meet asynchronously (almost) everywhere
Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite, unknown connected graph or in an unknown connected terrain in the plane. Agents ar...
Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc
CORR
2010
Springer
122views Education» more  CORR 2010»
15 years 2 months ago
Collision Helps - Algebraic Collision Recovery for Wireless Erasure Networks
Current medium access control mechanisms are based on collision avoidance and collided packets are discarded. The recent work on ZigZag decoding departs from this approach by recov...
Ali ParandehGheibi, Jay Kumar Sundararajan, Muriel...
CORR
2010
Springer
110views Education» more  CORR 2010»
15 years 2 months ago
Mixing Time and Stationary Expected Social Welfare of Logit Dynamics
We study logit dynamics [3] for strategic games. At every stage of the game a player is selected uniformly at random and she is assumed to play according to a noisy best-response ...
Vincenzo Auletta, Diodato Ferraioli, Francesco Pas...
CORR
2010
Springer
102views Education» more  CORR 2010»
15 years 2 months ago
Outage Probability of General Ad Hoc Networks in the High-Reliability Regime
Outage probabilities in wireless networks depend on various factors: the node distribution, the MAC scheme, and the models for path loss, fading and transmission success. In prior ...
Riccardo Giacomelli, Radha Krishna Ganti, Martin H...
106
Voted
CORR
2010
Springer
91views Education» more  CORR 2010»
15 years 2 months ago
Verifiable Network-Performance Measurements
In the current Internet, there is no clean way for affected parties to react to poor forwarding performance: to detect and assess Service Level Agreement (SLA) violations by a con...
Katerina J. Argyraki, Petros Maniatis, Ankit Singl...