On the average communication complexity of asynchronous distributed algorithms

On the average communication complexity of asynchronous distributed algorithms

Caption title.

Bibliographic Details
Other Authors:	Tsitsiklis, John N.
Language:	eng
Published:	Massachusetts Institute of Technology, Laboratory for Information and Decision Systems 2002
Subjects:	TK7855.M41 E3845 no.2338
Online Access:	http://hdl.handle.net/1721.1/1237

Similar Items

On the average communication complexity of asynchronous distributed algorithms
Published: (2003)

Communication complexity of distributed shortest path algorithms
Published: (2003)

Distributed asynchronous deterministic and stochastic gradient optimization algorithms
Published: (2002)

Finite termination of asynchronous iterative algorithms
Published: (2003)

Convergence rate and termination of asynchronous iterative algorithms
Published: (2003)

On the communication complexity of distributed algebraic computation
Published: (2003)

Distributed asynchronous relaxation methods for linear network flow problems
Published: (2003)

Partially asynchronous, parallel algorithms for network flow and other problems
Published: (2003)

On the rate of convergence of a partially asynchronous gradient projection algorithm
Published: (2003)

Some issues in distributed asynchronous routing in virtual circuit data networks
Published: (2003)

Asynchronous stochastic approximation and Q-learning
Published: (2003)

Average waiting time assignment.
Published: (2003)

Average waiting time assignment.
Published: (2003)

Parallel asynchronous Hungarian methods for the assignment problem
Published: (2003)

Communication complexity of convex optimization
Published: (2003)

On the use of random numbers in asynchronous simulation via rollback
Published: (2003)

Parallel asynchronous label correcting methods for shortest paths
Published: (2003)

Convergence of asynchronous matrix iterations subject to diagonal dominance
Published: (2003)

Average cost temporal-difference learning
Published: (2003)

Generalized averaging method for power conversion circuits
Published: (2003)

Optimal communication algorithms for hypercubes
Published: (2003)

On the communication complexity of solving a polynominal equation
Published: (2003)

Parallel asynchronous primal-dual methods for the minimum cost flow problem
Published: (2003)

Synthesis of averaged circuit models for switched power converters
Published: (2003)

Control of Markov chains with long-run average cost criterion
Published: (2003)

A value iteration method for the average cost dynamic programming problem
Published: (2003)

An adaptive distributed Dijkstra shortest path algorithm
Published: (2003)

Communication algorithms for isotropic tasks in hypercubes and wraparound meshes
Published: (2003)

Distributed asynchronous optimal routing in data networks
Published: (2002)

Parallel and distributed iterative algorithms : a selective survey
Published: (2003)

A survey of some aspects of parallel and distributed iterative algorithms
Published: (2003)

The auction algorithm : a distributed relaxation method for the assignment problem
Published: (2003)

Complexity analysis of a linear complementarity algorithm based on a Lyapunov function
Published: (2003)

A distributed hypothesis-testing team decision problem with communications cost
Published: (2003)

A fail-safe layer for distributed network algorithms and changing topologies
Published: (2003)

Low complexity signal processing and optimal joint detection for over-saturated multiple access communications
Published: (2003)

Linear averaged and sampled data models for large signal control of high power factor Ac-DC converters
Published: (2003)

Distributed asynchronous relaxation methods for convex network flow problems
Published: (2002)

The complexity of Markov decision processes
Published: (2003)

The information-based complexity of dynamic programming
Published: (2003)