103 search results - page 11 / 21 » Approximating rooted Steiner networks |
APPROX
2004
Springer
14 years 3 months ago
2004
Springer
We consider a single-source network design problem from a game-theoretic perspective. Gupta, Kumar and Roughgarden (Proc. 35th Annual ACM STOC, pages 365–372, 2003) developed a ...
ICASSP
2011
IEEE
13 years 2 months ago
2011
IEEE
The paper addresses the convergence of a decentralized Robbins-Monro algorithm for networks of agents. This algorithm combines local stochastic approximation steps for finding th...
PAM
2004
Springer
14 years 3 months ago
2004
Springer
Given that the global DNS system, especially at the higher root and top-levels, experiences significant query loads, we seek to answer the following questions: (1) How does the ch...
ICDE
2009
IEEE
15 years 3 days ago
2009
IEEE
Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in...
ICDCS
2006
IEEE
14 years 4 months ago
2006
IEEE
In this paper, we propose a novel Geographic Multicast routing Protocol (GMP) for wireless sensor networks1 . The proposed protocol is fully distributed and stateless. Given a set...