Name
Abstract | ||
|---|---|---|
We consider the problem of testing sequentially the components of a multi‐component system, when the testing of each component is costly. We propose a new testing policy, that can be executed in polynomial time in the input size, and show that it is cost‐minimal in the average case sense, for certain double regular systems that include regular (in particular, threshold) systems with identical components. This result generalizes known results for series, parallel, and, more generally, for k‐out‐of‐n systems. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1023/A:1018958928835 | Ann. Math. Artif. Intell. |
Keywords | Field | DocType |
Boolean Function,Binary Vector,Regular Function,Probability Vector,Threshold Function | Boolean function,Discrete mathematics,Probability vector,Time complexity,Mathematics,Threshold function | Journal |
Volume | Issue | ISSN |
26 | 1-4 | 1573-7470 |
Citations | PageRank | References |
13 | 0.66 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Endre Boros | 1 | 1779 | 155.63 |
| Tonguç Ünlüyurt | 2 | 102 | 8.94 |