2181 search results - page 313 / 437 » The restriction scaffold problem |
SAT
2005
Springer
14 years 2 months ago
2005
Springer
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...
UC
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
VLDB
2005
ACM
14 years 2 months ago
2005
ACM
A major challenge in frequent-pattern mining is the sheer size of its mining results. In many cases, a high min sup threshold may discover only commonsense patterns but a low one ...
DOLAP
2004
ACM
14 years 2 months ago
2004
ACM
Accurate summary data is of paramount concern in data warehouse systems; however, there have been few attempts to completely characterize the ability to summarize measures. The su...
ECLIPSE
2004
ACM
14 years 2 months ago
2004
ACM
Automated tools for mediating incoming interruptions are necessary in order to balance the concentration required for software development with the need to collaborate and absorb ...