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

淡江大學機構典藏 > 理學院 > 數學學系暨研究所 > 期刊論文 > Item 987654321/41318

請使用永久網址來引用或連結此文件: 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	537	檢視/開啟
A combinatorial problem from sooner waiting time problems with run and frequency quotas.pdf	168Kb	Adobe PDF	2	檢視/開啟
index.html	0Kb	HTML	259	檢視/開啟
index.html	0Kb	HTML	320	檢視/開啟

在機構典藏中所有的資料項目都受到原著作權保護.

TAIR相關文章