Sciweavers

1806 search results - page 130 / 362
» Randomness and halting probabilities
Sort
View
AI
2006
Springer
13 years 10 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth
MA
2010
Springer
140views Communications» more  MA 2010»
13 years 8 months ago
The Dirichlet Markov Ensemble
We equip the polytope of n × n Markov matrices with the normalized trace of the Lebesgue measure of Rn2 . This probability space provides random Markov matrices, with i.i.d. rows...
Djalil Chafaï
EUSFLAT
2009
175views Fuzzy Logic» more  EUSFLAT 2009»
13 years 7 months ago
The Minimization of the Risk of Falling in Portfolios under Uncertainty
Abstract-- A portfolio model to minimize the risk of falling under uncertainty is discussed. The risk of falling is represented by the value-at-risk of rate of return. Introducing ...
Yuji Yoshida
APNOMS
2006
Springer
14 years 1 months ago
An Enhanced RED-Based Scheme for Differentiated Loss Guarantees
Abstract. Recently, researchers have explored to provide a queue management scheme with differentiated loss guarantees for the future Internet. The Bounded Random Drop (BRD), known...
Jahwan Koo, Vladimir V. Shakhov, Hyunseung Choo
EATCS
1998
250views more  EATCS 1998»
13 years 9 months ago
Human Visual Perception and Kolmogorov Complexity: Revisited
Experiments have shown [2] that we can only memorize images up to a certain complexity level, after which, instead of memorizing the image itself, we, sort of, memorize a probabil...
Vladik Kreinovich, Luc Longpré