.png){kind=icon}
返回
A new strongly competitive group testing algorithm with small sequentiality
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-014-1766-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In many fault detection problems, we want to identify all defective items from a sample set of items using the minimum number of tests. Group testing is for the scenario where each test is performed on a subset of items, and tells whether the subset contains at least one defective item or not. In practice, the number of defective items in the sample set is usually unknown. In this paper, we investigate new algorithms for the group testing problem with unknown number of defective items. We consider the scenario where the performance of a group testing algorithm is measured by two criteria: the primary criterion is the number of tests performed, which measures the total cost spent; and the secondary criterion is the number of stages the algorithm works in, which is referred to as the sequentiality of the algorithm in this paper and measures the minimum amount of time required by using the algorithm to identify all the defective items. We present a new algorithm Recursive Binary Splitting (RBS) for the above group testing problem with unknown number of defective items, and prove an upper bound on the number of tests required by RBS. The computational results show that RBS exhibits very good practical performance, measured in terms of both the above two criteria.
Keyword:
Fault detection
Group testing
Algorithms
Sequentiality
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.5
论文数:
8.1K
被引数:
2.1W
机构
引用论文
Regular Ordered Ternary Semigroups in Terms of Bipolar Fuzzy Ideals基于双极模糊理想的正则有序三元半群.png)
Mathematics
OAAI
MathematicsIF0
OAAI分享收藏
Using a modified nasotracheal tube to prevent nasal ala pressure sore during prolonged nasotracheal intubation使用改良的鼻气管插管以预防长时间鼻气管插管期间鼻翼压迫性溃疡
PREAI
分享收藏
查看更多内容