1322 search results - page 82 / 265 » Parameterized counting problems |
FSTTCS
2010
Springer
13 years 6 months ago
2010
Springer
We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of thei...
CP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
IWPEC
2009
Springer
14 years 3 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
ICTAI
2005
IEEE
14 years 2 months ago
2005
IEEE
A large number of practical applications rely on effective algorithms for propositional model enumeration and counting. Examples include knowledge compilation, model checking and ...
PAKDD
2005
ACM
14 years 2 months ago
2005
ACM
We study the problem of mining frequent value sets from a large sensor network. We discuss how sensor stream data could be represented that facilitates efficient online mining and ...