6142 search results - page 335 / 1229 » The Complexity of Partition Functions |
183
click to vote
IJAR
2008
15 years 6 months ago
2008
This paper reviews probabilistic approaches to rough sets in granulation, approximation, and rule induction. The Shannon entropy function is used to quantitatively characterize pa...
144
click to vote
JSAT
2006
15 years 6 months ago
2006
It is well known that satisfiability of random sets of propositional clauses undergoes phase transition while the clause-to-variable ratio of the sets increases. We introduce anot...
180
click to vote
JCT
2007
15 years 6 months ago
2007
Abstract. Let n and k be natural numbers and let S(n, k) denote the Stirling numbers of the second kind. It is a conjecture of Wilf that the alternating sum nX j=0 (−1)j S(n, j) ...
171
click to vote
JCB
2000
15 years 6 months ago
2000
We present an implementation of McCaskill's algorithm for computing the base pair probabilities of an RNA molecule for massively parallel message passing architectures. The p...
166
click to vote
AAAI
1997
15 years 8 months ago
1997
Traditionally, qualitative simulation uses a global, state-based representation to describe the behavior of the modeled system. For larger, more complex systems this representatio...