450 search results - page 65 / 90 » Satisfiability with Exponential Families |
129
click to vote
CASES
2004
ACM
15 years 5 months ago
2004
ACM
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
106
click to vote
CORR
2011
Springer
14 years 3 months ago
2011
Springer
Efficient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problem...
ICML
2008
IEEE
16 years 18 days ago
2008
IEEE
We consider feature extraction (dimensionality reduction) for compositional data, where the data vectors are constrained to be positive and constant-sum. In real-world problems, t...
CADE
2006
Springer
16 years 3 days ago
2006
Springer
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
101
click to vote
SAC
2009
ACM
15 years 6 months ago
2009
ACM
We introduce a new data mining problem: mining truth tables in binary datasets. Given a matrix of objects and the properties they satisfy, a truth table identifies a subset of pr...