6251 search results - page 1 / 1251 » Randomness, Computability, and Density |
STACS
2001
Springer
13 years 9 months ago
2001
Springer
We study effectively given positive reals (more specifically, computably enumerable reals) under a measure of relative randomness introduced by Solovay [32] and studied by Calud...
DCC
2008
IEEE
14 years 4 months ago
2008
IEEE
CP
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. In this paper we consider the problem of computing the density of states of a Boolean formula in CNF, a generalization of both MAX-SAT and model counting. Given a Boolean...
CSDA
2004
13 years 4 months ago
2004
We present an algorithm for computing the probability density function of the product of two independent random variables, along with an implementation of the algorithm in a compu...
CSR
2007
Springer
13 years 11 months ago
2007
Springer
We propose a simple modification of a well-known Random Walk algorithm for solving the Satisfiability problem and analyze its performance on random CNFs with a planted solution. ...