A combinatorial problem from sooner waiting time problems with run and frequency quotas

淡江大學機構典藏 > 理學院 > 應用數學與數據科學學系 > 期刊論文 > Item 987654321/41318

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/41318

题名:	A combinatorial problem from sooner waiting time problems with run and frequency quotas
作者:	Gao, Tangan;吳孟年;Wu, Meng-nien
贡献者:	淡江大學數學學系
关键词:	Combinatorial counting problem;Multinomial coefficients;Markov dependent trials;Waiting time random variables;Probability generating functions
日期:	2006-09-15
上传时间:	2010-01-28 07:18:01 (UTC+8)
出版者:	Elsevier
摘要:	In this paper, we study the problem of finding the number of integer solutions solving View the MathML source Turn MathJax on for given f,r,w∈N with w⩾max(f,r). This problem is naturally from calculating exact distributions of some sooner waiting time random variables of run and frequency quotas in statistics. We present several solutions to the problem and develop an algorithm for the sooner waiting time problems. Numerical results are given to show the efficiency of our algorithm for calculating the exact distributions of the sooner waiting time random variable.
關聯:	Journal of Mathematical Analysis and Applications 321(2), pp.949-960
DOI:	10.1016/j.jmaa.2006.03.071
显示于类别:	[應用數學與數據科學學系] 期刊論文

文件中的档案:

档案	大小	格式	浏览次数
	0Kb	Unknown	604	检视/开启
A combinatorial problem from sooner waiting time problems with run and frequency quotas.pdf	168Kb	Adobe PDF	3	检视/开启
index.html	0Kb	HTML	345	检视/开启
index.html	0Kb	HTML	403	检视/开启

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章