The FINDSPACE Problem
| dc.date.accessioned | 2004-10-01T20:37:43Z | |
| dc.date.accessioned | 2018-11-24T10:10:42Z | |
| dc.date.available | 2004-10-01T20:37:43Z | |
| dc.date.available | 2018-11-24T10:10:42Z | |
| dc.date.issued | 1973-03-01 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/5811 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/5811 | |
| dc.description.abstract | The FINDSPACE problem is that of establishing a volume in space where an object of specified dimensions will fit. The problem seems to have two subproblems: the hypothesis generation problem of finding a likely spot to try, and the verification problem of testing that spot for occupancy by other objects. This paper treats primarily the verification problem. | en_US |
| dc.format.extent | 14 p. | en_US |
| dc.format.extent | 5330219 bytes | |
| dc.format.extent | 481076 bytes | |
| dc.language.iso | en_US | |
| dc.title | The FINDSPACE Problem | en_US |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| AIM-286.pdf | 481.0Kb | application/pdf | View/ |
| AIM-286.ps | 5.330Mb | application/postscript | View/ |