The FINDSPACE Problem

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

Full metadata record

DC Field	Value	Language
dc.creator	Sussman, Gerald J.	-
dc.date	2004-10-01T20:37:43Z	-
dc.date	2004-10-01T20:37:43Z	-
dc.date	1973-03-01	-
dc.date.accessioned	2013-10-09T02:41:25Z	-
dc.date.available	2013-10-09T02:41:25Z	-
dc.date.issued	2013-10-09	-
dc.identifier	AIM-286	-
dc.identifier	http://hdl.handle.net/1721.1/5811	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	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.	-
dc.format	14 p.	-
dc.format	5330219 bytes	-
dc.format	481076 bytes	-
dc.format	application/postscript	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	AIM-286	-
dc.title	The FINDSPACE Problem	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI