450 search results - page 27 / 90 » Satisfiability with Exponential Families |
158
click to vote
ICDM
2007
IEEE
16 years 9 days ago
2007
IEEE
In spite of the popularity of probabilistic mixture models for latent structure discovery from data, mixture models do not have a natural mechanism for handling sparsity, where ea...
164
click to vote
SIGECOM
2010
ACM
15 years 10 months ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
121
click to vote
AAAI
2008
15 years 8 months ago
2008
Checking CSP consistency is shown, in theory, to be an NP-complete problem. There is two families of methods for CSP consistency checking. The first family holds the complete meth...
132
click to vote
FMCAD
2006
Springer
15 years 9 months ago
2006
Springer
In this paper, a new heuristic-based approach is introduced to extract minimally unsatisfiable subformulas (in short, MUSes) of SAT instances. It is shown that it often outperforms...
157
click to vote
FORMATS
2008
Springer
15 years 7 months ago
2008
Springer
Metric Temporal Logic (MTL) is a widely-studied real-time extension of Linear Temporal Logic. In this paper we survey results about the complexity of the satisfiability and model c...