Randomized group testing for mutually obscuring defectives

DOI10.1016/S0020-0190(98)00096-9MaRDI QIDQ293335zbMATH OpenFDO

Authors Peter Damaschke

Publication date 9 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0020019098000969?np=y

zbMATH Keywords

computational complexitylearningcompetitivenessrandomized strategycounterfeit coin problemgroup testing problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• Group Testing with Multiple Mutually-Obscuring Positives
• Randomized group testing both query-optimal and minimal adaptive
• Bounds for nonadaptive group tests to estimate the amount of defectives
• Bounds for nonadaptive group tests to estimate the amount of defectives
• A randomized competitive group testing procedure

Cites work

• scientific article; zbMATH DE number 1775448 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• A group testing problem for hypergraphs of bounded rank
• A new competitive algorithm for the counterfeit coin problem
• Learning in the presence of finitely or infinitely many irrelevant attributes
• Modifications of Competitive Group Testing

Cited in

(13)

• Searching for a counterfeit coin with two unreliable weighings
• An efficient randomized group testing procedure to determine the number of defectives
• On parallel attribute-efficient learning.
• On optimal randomized group testing with one defective item and a constrained number of positive responses
• Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
• Static Risk-Based Group Testing Schemes Under Imperfectly Observable Risk
• A class of asymptotically optimal group testing strategies to identify good items
• Low-weight superimposed codes and related combinatorial structures: bounds and applications
• RECOVERING STRINGS IN ORACLES: QUANTUM AND CLASSIC
• Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing
• Searching for two counterfeit coins with two-arms balance
• Group Testing with Multiple Mutually-Obscuring Positives
• A class of asymptotically optimal group screening strategies with limited item participation

This page was built for publication: Randomized group testing for mutually obscuring defectives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293335)