Sciweavers

1806 search results - page 67 / 362
» Randomness and halting probabilities
Sort
View
CORR
2011
Springer
172views Education» more  CORR 2011»
13 years 3 months ago
Possibilities and impossibilities in Kolmogorov complexity extraction
Randomness extraction is the process of constructing a source of randomness of high quality from one or several sources of randomness of lower quality. The problem can be modeled ...
Marius Zimand
SIAMREV
2010
132views more  SIAMREV 2010»
13 years 3 months ago
A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
In this paper we propose and analyze a Stochastic-Collocation method to solve elliptic Partial Differential Equations with random coefficients and forcing terms (input data of the...
Ivo Babuska, Fabio Nobile, Raúl Tempone
FCT
2009
Springer
14 years 3 months ago
Martingales on Trees and the Empire Chromatic Number of Random Trees
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
Colin Cooper, Andrew R. A. McGrae, Michele Zito
WSC
2001
13 years 10 months ago
Global random optimization by simultaneous perturbation stochastic approximation
We examine the theoretical and numerical global convergence properties of a certain "gradient free" stochastic approximation algorithm called the "simultaneous pertu...
John L. Maryak, Daniel C. Chin
MOBICOM
2004
ACM
14 years 2 months ago
Revisiting the TTL-based controlled flooding search: optimality and randomization
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large network. Applications of this problem include searching fo...
Nicholas B. Chang, Mingyan Liu