A recursive solution to an occupancy problem resulting from TDM radio communication application

ASIA unversity > 資訊學院 > 光電與通訊學系 > 期刊論文 > Item 310904400/9505

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/9505

题名:	A recursive solution to an occupancy problem resulting from TDM radio communication application
作者:	Jyu-Wei Wang
关键词:	Occupancy problem;Multiple access capability;Time division multiplexing
日期:	1999-06
上传时间:	2010-05-12 01:11:41 (UTC+0)
出版者:	Asia University
摘要:	In this paper we treat an occupancy problem: the probability that m out of n boxes each have exactly one ball resulting from distributing k balls into n boxes. The solution to this problem is given by a set of recursive expressions. By translating these formulae into a computer program, one can easily obtain the numerical results.
關聯:	Applied Mathematics and Computation 101(1): 1-3
显示于类别:	[光電與通訊學系] 期刊論文

文件中的档案:

档案	大小	格式	浏览次数
	0Kb	Unknown	452	检视/开启

在ASIAIR中所有的数据项都受到原著作权保护.