6251 search results - page 182 / 1251 » Randomness, Computability, and Density |
147
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: The importance of stochasticity in cellular processes having low number of molecules has resulted in the development of stochastic models such as chemical master equat...
117
click to vote
STACS
2005
Springer
15 years 9 months ago
2005
Springer
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounde...
121
click to vote
ICPR
2006
IEEE
16 years 5 months ago
2006
IEEE
This paper integrates Markov random fields (MRFs) with type-2 fuzzy sets (T2 FSs) referred to as T2 FMRFs, which can handle the fuzziness of the labeling space as well as the rand...
170
click to vote
WIOPT
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract—We consider the problem of jointly optimizing random access and subgraph selection in coded wireless packet networks. As opposed to the corresponding scheduling approach...
137
click to vote
SIAMCOMP
2000
15 years 3 months ago
2000
This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a...