Sciweavers

4670 search results - page 3 / 934
» Testing that distributions are close
Sort
View
DEXAW
2007
IEEE
92views Database» more  DEXAW 2007»
14 years 3 months ago
Subtree Testing and Closed Tree Mining Through Natural Representations
Several classical schemes exist to represent trees as strings over a fixed alphabet; these are useful in many algorithmic and conceptual studies. Our previous work has proposed a...
José L. Balcázar, Albert Bifet, Anto...
SIGCSE
2006
ACM
139views Education» more  SIGCSE 2006»
14 years 3 months ago
Closing the loop on test creation: a question assessment mechanism for instructors
New accreditation requirements focus on education as a “continuous improvement process.” The most important part of such a process is that information gets fed back into the s...
Titus Winters, Tom Payne
ENTCS
2007
97views more  ENTCS 2007»
13 years 9 months ago
Can a Model Checker Generate Tests for Non-Deterministic Systems?
Modern software is increasingly concurrent, timed, distributed, and therefore, non-deterministic. While it is well known that tests can be generated as LTL or CTL model checker co...
Sergiy Boroday, Alexandre Petrenko, Roland Groz