Parallel asynchronous label correcting methods for shortest paths

Parallel asynchronous label correcting methods for shortest paths

Caption title. "May 1994 (revised October 1994)."

Detalhes bibliográficos
Outros Autores:	Bertsekas, Dimitri P.
Idioma:	eng
Publicado em:	Massachusetts Institute of Technology, Laboratory for Information and Decision Systems] 2003
Assuntos:	TK7855.M41 E3845 no.2274
Acesso em linha:	http://hdl.handle.net/1721.1/3390

Registros relacionados

A simple and fast label correcting algorithm for shortest paths
Publicado em: (2003)

Parallel shortest path auction algorithms
Publicado em: (2003)

An auction algorithm for shortest paths
Publicado em: (2003)

Polynomial auction algorithms for shortest paths
Publicado em: (2003)

Stochastic shortest path problems with recourse
Publicado em: (2003)

An analysis of stochastic shortest path problems
Publicado em: (2003)

Modified auction algorithms for shortest paths
Publicado em: (2003)

An adaptive distributed Dijkstra shortest path algorithm
Publicado em: (2003)

Communication complexity of distributed shortest path algorithms
Publicado em: (2003)

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

Efficient algorithms for continuous-space shortest path problems
Publicado em: (2003)

Forward path search : a new dual coordinate ascent algorithm for shortest paths
Publicado em: (2003)

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

An auction/sequential shortest path algorithm for the minimum cost network flow problem
Publicado em: (2003)

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

Asymptotic optimality of shortest path routing
Publicado em: (2003)

A distributed shortest path protocol
Publicado em: (2002)

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

Asynchronous stochastic approximation and Q-learning
Publicado em: (2003)

Finite termination of asynchronous iterative algorithms
Publicado em: (2003)

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

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

On the average communication complexity of asynchronous distributed algorithms
Publicado em: (2002)

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

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

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

Stochastic shortest path games : theory and algorithms
por: Patek, Stephen D. (Stephen David)
Publicado em: (2005)

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

Parallel primal-dual methods for the minimum cost flow problem
Publicado em: (2003)

Dynamic broadcasting in parallel computing
Publicado em: (2003)

Parallel computing in network optimization
Publicado em: (2003)

Communication aspects of parallel processing
Publicado em: (2003)

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

A new parallel smoothing algorithm
Publicado em: (2003)

Parallel smoothing algorithms for causal and acausal systems
Publicado em: (2002)

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

A comparison of Jacobi and Gauss-Seidel parallel iterations
Publicado em: (2003)

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

A path-following algorithm for linear programming using quadratic and logarithmic penalty functions
Publicado em: (2003)

Lower bounds on the time to compute a simple boolean function on a parallel random access machine
Publicado em: (2003)