16404 search results - page 631 / 3281 » A set coverage problem |
164
click to vote
ECML
1993
Springer
15 years 11 months ago
1993
Springer
This paper addresses the problem of classifying observations when features are context-sensitive, specifically when the testing set involves a context that is different from the t...
224
click to vote
AAAI
2008
15 years 9 months ago
2008
We describe HTN-MAKER, an algorithm for learning hierarchical planning knowledge in the form of decomposition methods for Hierarchical Task Networks (HTNs). HTNMAKER takes as inpu...
204
click to vote
NAR
2008
15 years 7 months ago
2008
The University of California, Santa Cruz, Genome Browser Database (GBD) provides integrated sequence and annotation data for a large collection of vertebrate and model organism ge...
178
click to vote
ITC
2002
IEEE
16 years 2 days ago
2002
IEEE
Efficient production testing is frequently hampered because current digital circuits require test sets which are too large. These test sets can be reduced significantly by means...
204
click to vote
CONCUR
2005
Springer
16 years 21 days ago
2005
Springer
We introduce two abstract models for multithreaded programs based on dynamic networks of pushdown systems. We address the problem of symbolic reachability analysis for these models...