Efficient algorithms for continuous-space shortest path problems

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/3404

Full metadata record

DC Field	Value	Language
dc.contributor	Polymenakos, Lazaros.	-
dc.contributor	Bertsekas, Dimitri P.	-
dc.contributor	Tsitsiklis, John N.	-
dc.contributor	Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.	-
dc.date	2003-04-29T15:41:30Z	-
dc.date	2003-04-29T15:41:30Z	-
dc.date	1995	-
dc.date.accessioned	2013-06-04T16:17:09Z	-
dc.date.available	2013-06-04T16:17:09Z	-
dc.date.issued	2013-06-05	-
dc.identifier	http://hdl.handle.net/1721.1/3404	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	L.C. Polymenakos, D.P. Bertsekas, J.N. Tsitsiklis.	-
dc.description	Caption title.	-
dc.description	Includes bibliographical references (p. 11-12).	-
dc.description	Supported by the NSF. 9300494-DMI Supported by the AFO. DAAL03-92-G-0115	-
dc.format	13 p.	-
dc.format	1095266 bytes	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Massachusetts Institute of Technology, Laboratory for Information and Decision Systems]	-
dc.relation	LIDS-P ; 2292	-
dc.subject	TK7855.M41 E3845 no.2292	-
dc.title	Efficient algorithms for continuous-space shortest path problems	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI