首页 | 本学科首页   官方微博 | 高级检索  
     


A combinatorial problem from sooner waiting time problems with run and frequency quotas
Authors:Tangan Gao
Affiliation:a Department of Mathematics and Statistics, California State University, Long Beach, CA 90840, USA
b Department of Mathematics, Tamkang University, Danshui, Taiwan 251, Taiwan
Abstract:In this paper, we study the problem of finding the number of integer solutions solving
View the MathML source
Keywords:Combinatorial counting problem   Multinomial coefficients   Markov dependent trials   Waiting time random variables   Probability generating functions
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号