Sciweavers

10715 search results - page 175 / 2143
» Proofs from Tests
Sort
View
AAAI
1992
15 years 1 months ago
A Probabilistic Parser Applied to Software Testing Documents
We describe an approach to training a statistical parser from a bracketed corpus, and demonstrate its use in a software testing application that translates English speci cations i...
Mark A. Jones, Jason Eisner
FOCS
2002
IEEE
15 years 5 months ago
A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
Andrej Bogdanov, Kenji Obata, Luca Trevisan
94
Voted
DAC
1998
ACM
15 years 5 months ago
Efficient Analog Test Methodology Based on Adaptive Algorithms
This papers describes a new, fast and economical methodology to test linear analog circuits based on adaptive algorithms. To the authors knowledge, this is the first time such tec...
Luigi Carro, Marcelo Negreiros
EDM
2008
127views Data Mining» more  EDM 2008»
15 years 2 months ago
Adaptive Test Design with a Naive Bayes Framework
Bayesian graphical models are commonly used to build student models from data. A number of standard algorithms are available to train Bayesian models from student skills assessment...
Michel C. Desmarais, Alejandro Villarreal, Michel ...
74
Voted
APLAS
2008
ACM
15 years 2 months ago
The Complexity of Coverage
Abstract. We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between th...
Krishnendu Chatterjee, Luca de Alfaro, Rupak Majum...