Optimal search procedure on coin-weighing problem
From MaRDI portal
Publication:2507901
DOI10.1016/j.jspi.2005.06.008zbMath1098.90037OpenAlexW2021188853MaRDI QIDQ2507901
Wen An Liu, Zan-Kan Nie, Qi-min Zhang
Publication date: 5 October 2006
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jspi.2005.06.008
Related Items (2)
Minimal average cost of searching for a counterfeit coin: restricted model ⋮ Searching for a counterfeit coin with \(b\)-balance
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two counterfeit coins
- How to find many counterfeit coins?
- Five counterfeit coins
- Search problems for two irregular coins with incomplete feedback: The underweight model
- An improved algorithm for quantitative group testing
- A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance
- A new competitive algorithm for the counterfeit coin problem
- On the conjecture at two counterfeit coins
- Optimal detection of two counterfeit coins with two-arms balance.
- Optimal detection of a counterfeit coin with multi-arms balances
- On various versions of the defective coin problem
- Optimal Detection of Two Defectives with a Parity Check Device
- The Counterfeit Coin Problem Revisited
- Coin-Weighing Problems
This page was built for publication: Optimal search procedure on coin-weighing problem
