Name
Abstract | ||
|---|---|---|
The following restricted model of coin-weighing problem is considered: there is a heavier coin in a set of n coins, n - 1 of which are good coins having the same weight. The test device is a two-arms balance scale and each test-set is of the form A : B with |A| = |B| ≤ l, where l ≥ 1 is a given integer. We present an optimal sequential algorithm requiring the minimal average cost of weighings when the probability distribution on the coin set is uniform distribution. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.dam.2006.03.017 | Discrete Applied Mathematics |
Keywords | Field | DocType |
huffman tree,minimal average cost,uniform distribution,following restricted model,coin set,counterfeit coin,average cost,good coin,sequential algorithm,coin-weighing problem,optimal sequential algorithm,n coin,heavier coin,probability distribution | Integer,Discrete mathematics,Combinatorics,Of the form,Uniform distribution (continuous),Average cost,Probability distribution,Huffman coding,Sequential algorithm,Group testing,Mathematics | Journal |
Volume | Issue | ISSN |
154 | 14 | Discrete Applied Mathematics |
Citations | PageRank | References |
2 | 0.39 | 13 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wen An Liu | 1 | 65 | 12.61 |
| Hong Yong Ma | 2 | 2 | 0.39 |