Sciweavers

204 search results - page 29 / 41
» Parameterizations of Test Cover with Bounded Test Sizes
Sort
View
NAACL
1994
14 years 11 months ago
Multilingual Speech Databases at LDC
As multilingual products and technology grow in importance, the Linguistic Data Consortium (LDC) intends to provide the resources needed for research and development activities, e...
John J. Godfrey
DAGSTUHL
2004
14 years 11 months ago
Finding Isolated Cliques by Queries -- An Approach to Fault Diagnosis with Many Faults
A well-studied problem in fault diagnosis is to identify the set of all good processors in a given set {p1, p2, . . . , pn} of processors via asking some processors pi to test whet...
William I. Gasarch, Frank Stephan
ALT
2006
Springer
15 years 7 months ago
Iterative Learning from Positive Data and Negative Counterexamples
A model for learning in the limit is defined where a (so-called iterative) learner gets all positive examples from the target language, tests every new conjecture with a teacher ...
Sanjay Jain, Efim B. Kinber
ICST
2009
IEEE
15 years 5 months ago
Optimizing Generation of Object Graphs in Java PathFinder
Java PathFinder (JPF) is a popular model checker for Java programs. JPF was used to generate object graphs as test inputs for object-oriented programs. Specifically, JPF was used...
Milos Gligoric, Tihomir Gvero, Steven Lauterburg, ...
CP
2008
Springer
15 years 5 days ago
Exploiting Decomposition in Constraint Optimization Problems
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
Matthew Kitching, Fahiem Bacchus