A class of efficient contention resolution algorithms for multiple access channels

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

Full metadata record

DC Field	Value	Language
dc.contributor	Humblet, Pierre A.	-
dc.contributor	Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.	-
dc.contributor	Mosely, Jeannine.	-
dc.date	2002-06-21T03:39:20Z	-
dc.date	2002-06-21T03:39:20Z	-
dc.date	1982	-
dc.date.accessioned	2013-05-31T15:36:27Z	-
dc.date.available	2013-05-31T15:36:27Z	-
dc.date.issued	2013-05-31	-
dc.identifier	http://hdl.handle.net/1721.1/1035	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/jspui/handle/1721	-
dc.description	by Jeannine Mosely and Pierre Humblet.	-
dc.description	Bibliography: p. [32]	-
dc.description	"March 1982."	-
dc.description	Defense Advanced Research Projects Agency Contract No. ARPA ONR/N00014-75-1183 National Science Foundation Grant No. NSF ECS 79-19880	-
dc.format	27, [5] p.	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Laboratory for Information and Decision Systems, Massachusetts Institute of Technology	-
dc.relation	LIDS-P ; 1194	-
dc.subject	TK7855.M41 E3845 no.1194	-
dc.subject	Discrete-time systems	-
dc.title	A class of efficient contention resolution algorithms for multiple access channels	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI