Show simple item record

On Randomized Path Coverage of Configuration Spaces

dc.date.accessioned2013-11-18T20:00:08Z
dc.date.accessioned2018-11-26T22:27:06Z
dc.date.available2013-11-18T20:00:08Z
dc.date.available2018-11-26T22:27:06Z
dc.date.issued2013-11-18
dc.identifier.urihttp://hdl.handle.net/1721.1/82462
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/82462
dc.description.abstractWe present a sampling-based algorithm that generates a set of locally-optimal paths that differ in visibility.en_US
dc.format.extent13 p.en_US
dc.rightsCreative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/en_US
dc.titleOn Randomized Path Coverage of Configuration Spacesen_US


Files in this item

FilesSizeFormatView
MIT-CSAIL-TR-2013-027.pdf5.270Mbapplication/pdfView/Open

This item appears in the following Collection(s)

Show simple item record

Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported
Except where otherwise noted, this item's license is described as Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported