1422 search results - page 36 / 285 » Test Generation Algorithms Based on Preorder Relations |
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
157
click to vote
KES
2011
Springer
14 years 4 months ago
2011
Springer
When students study for multiple-choice cloze tests as the Test of English for International Communication (TOEIC), they tend to repeatedly tackle questions of the same type. In su...
BMCBI
2006
14 years 9 months ago
2006
Background: The development of algorithms to infer the structure of gene regulatory networks based on expression data is an important subject in bioinformatics research. Validatio...
ICLP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. This paper proposes a diagnosis algorithm for locating a certain kind of errors in logic programs: variable binding errors that result act symptoms during compile-time ch...
ACL
2001
14 years 11 months ago
2001
We present conditions under which verb phrases are elided based on a corpus of positive and negative examples. Factor that affect verb phrase ellipsis include: the distance betwee...