CSpace
匹配排队网络的忙期英文
徐光; 曹成铉
2000
Source Publication运筹学学报
ISSN1007-6093
Volume4Issue:1Pages:22
Abstract该文考虑了匹配排队网络PH/M/C→PH/PH/1,研究了两个子系统和整个网络的忙期与非闲期的概率分布,得到了具有一致误差的算法.然后证明了这些算法的时间与空间的计算复杂性都是多项式的.最后给出了数例.
Language英语
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/40991
Collection中国科学院数学与系统科学研究院
Affiliation中国科学院数学与系统科学研究院
Recommended Citation
GB/T 7714
徐光,曹成铉. 匹配排队网络的忙期英文[J]. 运筹学学报,2000,4(1):22.
APA 徐光,&曹成铉.(2000).匹配排队网络的忙期英文.运筹学学报,4(1),22.
MLA 徐光,et al."匹配排队网络的忙期英文".运筹学学报 4.1(2000):22.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[徐光]'s Articles
[曹成铉]'s Articles
Baidu academic
Similar articles in Baidu academic
[徐光]'s Articles
[曹成铉]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[徐光]'s Articles
[曹成铉]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.