Sciweavers

2735 search results - page 9 / 547
» Comparing notions of randomness
Sort
View
ISSE
2010
13 years 2 months ago
Randomized constraint solvers: a comparative study
Mitsuo Takaki, Diego Cavalcanti, Rohit Gheyi, Juli...
JCT
2000
96views more  JCT 2000»
13 years 7 months ago
On Tail Distribution of Interpost Distance
A partial order on Z obtained by taking the transitive closure of a random relation {i < j and there is an edge ij} is studied. Randomness stems from postulating that an edge ij...
Jeong Han Kim, Boris Pittel
CSR
2006
Springer
13 years 11 months ago
Constructive Equivalence Relations on Computable Probability Measures
A central object of study in the field of algorithmic randomness are notions of randomness for sequences, i.e., infinite sequences of zeros and ones. These notions are usually def...
Laurent Bienvenu
AAAI
2008
13 years 9 months ago
Backdoor Trees
The surprisingly good performance of modern satisfiability (SAT) solvers is usually explained by the existence of a certain "hidden structure" in real-world instances. W...
Marko Samer, Stefan Szeider
CISC
2007
Springer
152views Cryptology» more  CISC 2007»
14 years 1 months ago
Orthogonality between Key Privacy and Data Privacy, Revisited
Abstract. Key privacy is a notion regarding the privacy of the owner of a public key, which has important applications in building (receiver) anonymous channels, or privacy-enhance...
Rui Zhang 0002, Goichiro Hanaoka, Hideki Imai