Show simple item record

Dynamic shortest path algorithms for IVHS applications

dc.contributor.authorFarkas, András, 1965-en_US
dc.date.accessioned2005-08-15T23:21:01Z
dc.date.available2005-08-15T23:21:01Z
dc.date.copyright1993en_US
dc.date.issued1993en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/12400
dc.descriptionThesis (M.S.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 1993.en_US
dc.descriptionIncludes bibliographical references (leaves 92-94).en_US
dc.description.statementofresponsibilityby Andras Farkas.en_US
dc.format.extent94 leavesen_US
dc.format.extent7241723 bytes
dc.format.extent7241485 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/pdf
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsM.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.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582
dc.subjectCivil and Environmental Engineeringen_US
dc.titleDynamic shortest path algorithms for IVHS applicationsen_US
dc.typeThesisen_US
dc.description.degreeM.S.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Civil and Environmental Engineering
dc.identifier.oclc29369228en_US


Files in this item

Thumbnail
Name:
29369228-MIT.pdf
Size:
6.906Mb
Format:
PDF
Description:
Full printable version
View/Open

This item appears in the following Collection(s)

Show simple item record