319 search results - page 29 / 64 » Convergence rates of consensus algorithms in stochastic netw... |
121
click to vote
JSAC
2008
15 years 1 months ago
2008
In this paper, we study the theoretical problem of the end-to-end rate assignment for multi-hop wireless networks. Specifically, we consider the problem of joint congestion control...
104
click to vote
CDC
2008
IEEE
15 years 7 months ago
2008
IEEE
— Time-varying graphs are widely used to model communication and sensing in multi-agent systems such as mobile sensor networks and dynamic animal groups. Connectivity is often de...
108
click to vote
TNN
1998
15 years 29 days ago
1998
— In this paper, we perform a complete asymptotic performance analysis of the stochastic approximation algorithm (denoted subspace network learning algorithm) derived from Oja’...
102
click to vote
KDD
2009
ACM
16 years 1 months ago
2009
ACM
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...
INFOCOM
2005
IEEE
15 years 7 months ago
2005
IEEE
— We consider optimal control for general networks with both wireless and wireline components and time varying channels. A dynamic strategy is developed to support all traffic w...