107 search results - page 7 / 22 » Computing subsets of equivalence classes for large FSMs |
ENTCS
2007
13 years 6 months ago
2007
Much of the literature on symmetry reductions for model checking assumes a simple model of computation where the local state of each component in a concurrent system can be repres...
ICDE
2008
IEEE
14 years 8 months ago
2008
IEEE
Aggregate measures summarizing subsets of data are valuable in exploratory analysis and decision support, especially when dependent aggregations can be easily specified and compute...
BSL
2005
13 years 6 months ago
2005
A mass problem is a set of Turing oracles. If P and Q are mass problems, we say that P is weakly reducible to Q if every member of Q Turing computes a member of P. We say that P i...
SIGMETRICS
2009
ACM
14 years 1 months ago
2009
ACM
Understanding the channel popularity or content popularity is an important step in the workload characterization for modern information distribution systems (e.g., World Wide Web,...
TSMC
2010
13 years 1 months ago
2010
The original rough-set model is primarily concerned with the approximations of sets described by a single equivalence relation on a given universe. With granular computing point of...