Results 241 to 250 of about 72,191 (269)

Self-test scheduling with bounded test execution time

Proceedings International Test Conference 1992, 1992
Complex VLSI circuits with built-in self-test resources are segmented into a number of subcircuits, that to some extent can be tested concurrently. For each subcircuit a signature is collected. The test schedule has to organize the test execution such that the available resources are optimally utilized.
openaire   +1 more source

Bounds on 2-Query Codeword Testing

2003
We present upper bounds on the size of codes that are locally testable by querying only two input symbols. For linear codes, we show that any 2-locally testable code with minimal distance δn over any finite field \(\mathbb{F}\) cannot have more than \(|\mathbb{F}|^{3/\delta}\) codewords. This result holds even for testers with two-sided error.
Eli Ben-Sasson, Oded Goldreich 0001, Madhu Sudan 0001   +2 more
openaire   +2 more sources

A Series of Lower Bounds to the Reliability of a Test

Psychometrika, 1978
Two well-known lower bounds to the reliability in classical test theory, Guttman’s λ2 and Cronbach’s coefficient alpha, are shown to be terms of an infinite series of lower bounds. All terms of this series are equal to the reliability if and only if the test is composed of items which are essentially tau-equivalent.
ten Berge, J.M.F., Zegers, F.E.
openaire   +3 more sources

Isomorphism testing for graphs of bounded genus

Proceedings of the twelfth annual ACM symposium on Theory of computing - STOC '80, 1980
We present an algorithm which determines isomorphism of graphs in vO(g)steps where v is the number of vertices and g is the genus of the graphs. In [FMR 79] an algorithm was presented for embedding graph on surfaces of genus g in vO(g) steps. Here we show how to extend this algorithm to isomorphism testing for graphs of small genus.
openaire   +1 more source

Tight Bounds for Testing k-Linearity

2012
The function \(f : \mathbb{F}_2^n \to \mathbb{F}_2\) is k-linear if it returns the sum (over \(\mathbb{F}_2\)) of exactly k coordinates of its input. We introduce strong lower bounds on the query complexity for testing whether a function is k-linear.
Eric Blais, Daniel M. Kane
openaire   +1 more source

Better Bounds for Event Sequencing Testing

2013 IEEE Sixth International Conference on Software Testing, Verification and Validation Workshops, 2013
A permutation of a sequence of events is a common construction in many testing environments. Covering all possible permutations has clearly an exponential behavior; so one can ask for partial (easier) requirement, to cover all possible orders: permutations induced on of a small cardinality subset of elements. In our paper we show better (both lower and
openaire   +1 more source

A guided tour of chernoff bounds

Information Processing Letters, 1990
Torben Hagerup
exaly  

Reliability Bounds for Multistate Systems with Multistate Components

Operations Research, 1985
Kailash C Kapur
exaly  

Validity, tightness, and forecasting power of risk premium bounds

Journal of Financial Economics, 2022
exaly  

Changes in the Distribution of Male and Female Wages Accounting for Employment Composition Using�Bounds

Econometrica, 2007
Richard W Blundell, Hidehiko Ichimura, Costas Meghir   +2 more
exaly