2254 search results - page 157 / 451 » Computing the minimal covering set |
260
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
177
click to vote
NAR
2011
14 years 9 months ago
2011
The current 18th Database Issue of Nucleic Acids Research features descriptions of 96 new and 83 updated online databases covering various areas of molecular biology. It includes ...
170
click to vote
DAC
2008
ACM
16 years 7 months ago
2008
ACM
Extensive software-based simulation continues to be the mainstream methodology for functional verification of designs. To optimize the use of limited simulation resources, coverag...
201
click to vote
FOSSACS
2007
Springer
15 years 10 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
171
click to vote
EWCBR
2004
Springer
15 years 12 months ago
2004
Springer
Over the years, many successful applications of case-based reasoning (CBR) systems have been developed in different areas. The performance of CBR systems depends on several factor...