Results 271 to 280 of about 6,910,975 (305)
Some of the next articles are maybe not open access.
A lower bound for testing juntas
Information Processing Letters, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hana Chockler, Dan Gutfreund
openaire +2 more sources
Testing Outerplanarity of Bounded Degree Graphs
Algorithmica, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yuichi Yoshida, Hiro Ito
openaire +2 more sources
Property Testing in Bounded Degree Graphs
Algorithmica, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oded Goldreich 0001, Dana Ron
openaire +3 more sources
A lower bound for testing 3-colorability in bounded-degree graphs
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., 2003We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough /spl epsiv/, every tester for 3-colorability must have query complexity /spl Omega/(n). This is the first linear lower bound for testing a natural graph property in the bounded-degree model.
Andrej Bogdanov +2 more
openaire +2 more sources
An upper bound on software testing effectiveness
ACM Transactions on Software Engineering and Methodology, 2008Failure patterns describe typical ways in which inputs revealing program failure are distributed across the input domain—in many cases, clustered together in contiguous regions. Based on these observations several debug testing methods have been developed.
Tsong Yueh Chen, Robert G. Merkel
openaire +3 more sources
Bounds for threshold and majority group testing
2011 IEEE International Symposium on Information Theory Proceedings, 2011We consider two generalizations of group testing: threshold group testing (introduced by Damaschke [8]) and majority group testing (a further generalization, including threshold group testing and a model introduced by Lebedev [15]).
Rudolf Ahlswede +2 more
openaire +2 more sources
Self-test scheduling with bounded test execution time
Proceedings International Test Conference 1992, 1992Complex 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 +2 more sources
A Series of Lower Bounds to the Reliability of a Test
Psychometrika, 1978Two 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
Better Bounds for Event Sequencing Testing
2013 IEEE Sixth International Conference on Software Testing, Verification and Validation Workshops, 2013A 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 +2 more sources
Bounds on 2-Query Codeword Testing
2003We 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 +2 more
openaire +3 more sources