Sciweavers

27 search results - page 1 / 6
» De Finetti's contribution to the theory of random functions
Sort
View
CIE
2009
Springer
13 years 11 months ago
Computable Exchangeable Sequences Have Computable de Finetti Measures
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
Cameron E. Freer, Daniel M. Roy
JMLR
2010
92views more  JMLR 2010»
12 years 11 months ago
Posterior distributions are computable from predictive distributions
As we devise more complicated prior distributions, will inference algorithms keep up? We highlight a negative result in computable probability theory by Ackerman, Freer, and Roy (...
Cameron E. Freer, Daniel M. Roy
EMO
2005
Springer
126views Optimization» more  EMO 2005»
13 years 10 months ago
The Evolution of Optimality: De Novo Programming
Abstract. Evolutionary algorithms have been quite effective in dealing with single-objective “optimization” while the area of Evolutionary Multiobjective Optimization (EMOO) h...
Milan Zeleny
QEST
2010
IEEE
13 years 2 months ago
On the Theory of Stochastic Processors
Traditional architecture design approaches hide hardware uncertainties from the software stack through overdesign, which is often expensive in terms of power consumption. The recen...
Parasara Sridhar Duggirala, Sayan Mitra, Rakesh Ku...