Analysis of parallel asynchronous schemes for the auction shortest path algorithm

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1991. === Includes bibliographical references (leaves 114-115). === by Lazoros Polymenakos. === M.S.

Bibliographic Details
Main Author:	Polymenakos, Lazaros
Other Authors:	Dimitri P. Bersekas.
Format:	Others
Language:	English
Published:	Massachusetts Institute of Technology 2005
Subjects:	Electrical Engineering and Computer Science
Online Access:	http://hdl.handle.net/1721.1/13285

id	ndltd-MIT-oai-dspace.mit.edu-1721.1-13285
record_format	oai_dc
spelling	ndltd-MIT-oai-dspace.mit.edu-1721.1-132852019-05-02T16:14:35Z Analysis of parallel asynchronous schemes for the auction shortest path algorithm Polymenakos, Lazaros Dimitri P. Bersekas. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science Electrical Engineering and Computer Science Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1991. Includes bibliographical references (leaves 114-115). by Lazoros Polymenakos. M.S. 2005-09-21T21:03:06Z 2005-09-21T21:03:06Z 1991 1991 Thesis http://hdl.handle.net/1721.1/13285 25055489 eng M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 115 leaves 6559332 bytes 6559091 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology
collection	NDLTD
language	English
format	Others
sources	NDLTD
topic	Electrical Engineering and Computer Science
spellingShingle	Electrical Engineering and Computer Science Polymenakos, Lazaros Analysis of parallel asynchronous schemes for the auction shortest path algorithm
description	Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1991. === Includes bibliographical references (leaves 114-115). === by Lazoros Polymenakos. === M.S.
author2	Dimitri P. Bersekas.
author_facet	Dimitri P. Bersekas. Polymenakos, Lazaros
author	Polymenakos, Lazaros
author_sort	Polymenakos, Lazaros
title	Analysis of parallel asynchronous schemes for the auction shortest path algorithm
title_short	Analysis of parallel asynchronous schemes for the auction shortest path algorithm
title_full	Analysis of parallel asynchronous schemes for the auction shortest path algorithm
title_fullStr	Analysis of parallel asynchronous schemes for the auction shortest path algorithm
title_full_unstemmed	Analysis of parallel asynchronous schemes for the auction shortest path algorithm
title_sort	analysis of parallel asynchronous schemes for the auction shortest path algorithm
publisher	Massachusetts Institute of Technology
publishDate	2005
url	http://hdl.handle.net/1721.1/13285
work_keys_str_mv	AT polymenakoslazaros analysisofparallelasynchronousschemesfortheauctionshortestpathalgorithm
_version_	1719036748366872576

Analysis of parallel asynchronous schemes for the auction shortest path algorithm

Similar Items