557 search results - page 16 / 112 » On the convergence time of distributed quantized averaging a... |
STOC
2002
ACM
14 years 8 months ago
2002
ACM
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
APPROX
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
ICML
2001
IEEE
14 years 8 months ago
2001
IEEE
As multiagent environments become more prevalent we need to understand how this changes the agent-based paradigm. One aspect that is heavily affected by the presence of multiple a...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract--In this two-part paper, we study the design and optimization of limited feedback single-user and multiuser systems with a multiple-antenna base station and single-antenna...
JPDC
2007
13 years 7 months ago
2007
We present fast distributed local control Connected Dominating Set (CDS) algorithms for wireless ad hoc networks. We present two randomized distributed algorithms, CDSColor and CD...