Sciweavers

3 search results - page 1 / 1
» Can Uncertainty Management be Realized in a Finite Totally O...
Sort
View
UAI
1989
13 years 8 months ago
Can Uncertainty Management be Realized in a Finite Totally Ordered Probability Algebra?
In this paper, the feasibility of using finite totally ordered probability models under Aleliunas’s Theory of Probabilistic Logic [Aleliunas, 1988] is investigated. The general...
Yang Xiang, Michael P. Beddoes, David Poole
CONSTRAINTS
2010
116views more  CONSTRAINTS 2010»
13 years 4 months ago
Enabling local computation for partially ordered preferences
Abstract. Many computational problems linked to uncertainty and preference management can be expressed in terms of computing the marginal(s) of a combination of a collection of val...
Hélène Fargier, Emma Rollon, Nic Wil...
SIGMOD
2012
ACM
242views Database» more  SIGMOD 2012»
11 years 10 months ago
Dynamic management of resources and workloads for RDBMS in cloud: a control-theoretic approach
As cloud computing environments become explosively popular, dealing with unpredictable changes, uncertainties, and disturbances in both systems and environments turns out to be on...
Pengcheng Xiong