中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
COMPETITIVE GROUP-TESTING

文献类型:期刊论文

作者DU, DZ; HWANG, FK
刊名DISCRETE APPLIED MATHEMATICS
出版日期1993-09-07
卷号45期号:3页码:221-232
ISSN号0166-218X
英文摘要Let M(A)(n,d) denote the maximum number of group tests for a group testing algorithm A to identify d defectives from a set of n items when d is known, and let M(A)(n\d) denote the number when d is unknown. Define M(n,d) = min(A) M(A)(n,d). An algorithm A is called a competitive algorithm if there exist constants c and a such that for all n > d greater-than-or-equal-to 0, M(A)(n\d) less-than-or-equal-to cM(n,d) + a. In this paper, we present some competitive group testing algorithms.
WOS研究方向Mathematics
语种英语
WOS记录号WOS:A1993LY69500005
出版者ELSEVIER SCIENCE BV
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/28069]  
专题中国科学院数学与系统科学研究院
作者单位1.AT&T BELL LABS,MATH SCI RES CTR,600 MTN AVE,MURRAY HILL,NJ 07974
2.PRINCETON UNIV,DEPT COMP SCI,PRINCETON,NJ 08544
3.CHINESE ACAD SCI,INST APPL MATH,BEIJING,PEOPLES R CHINA
推荐引用方式
GB/T 7714
DU, DZ,HWANG, FK. COMPETITIVE GROUP-TESTING[J]. DISCRETE APPLIED MATHEMATICS,1993,45(3):221-232.
APA DU, DZ,&HWANG, FK.(1993).COMPETITIVE GROUP-TESTING.DISCRETE APPLIED MATHEMATICS,45(3),221-232.
MLA DU, DZ,et al."COMPETITIVE GROUP-TESTING".DISCRETE APPLIED MATHEMATICS 45.3(1993):221-232.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。