Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/3404| Title: | Efficient algorithms for continuous-space shortest path problems |
| Authors: | Polymenakos, Lazaros. Bertsekas, Dimitri P. Tsitsiklis, John N. Massachusetts Institute of Technology. Laboratory for Information and Decision Systems. |
| Keywords: | TK7855.M41 E3845 no.2292 |
| Issue Date: | 5-Jun-2013 |
| Publisher: | Massachusetts Institute of Technology, Laboratory for Information and Decision Systems] |
| Description: | L.C. Polymenakos, D.P. Bertsekas, J.N. Tsitsiklis. Caption title. Includes bibliographical references (p. 11-12). Supported by the NSF. 9300494-DMI Supported by the AFO. DAAL03-92-G-0115 |
| URI: | http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
| Other Identifiers: | http://hdl.handle.net/1721.1/3404 |
| Appears in Collections: | MIT Items |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.