2354 search results - page 242 / 471 » Randomness, Stochasticity and Approximations |
147
click to vote
JAL
2002
15 years 5 months ago
2002
The normalized number of key comparisons needed to sort a list of randomly permuted items by the Quicksort algorithm is known to converge in distribution. We identify the rate of ...
169
click to vote
JAIR
2010
15 years 4 months ago
2010
This paper deals with value (and Q-) function approximation in deterministic Markovian decision processes (MDPs). A general statistical framework based on the Kalman filtering pa...
267
click to vote
SIAMCOMP
2011
14 years 8 months ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
158
click to vote
IJON
2007
15 years 5 months ago
2007
Existing models of EEG have mainly focused on relations to network dynamics characterized by firing rates [L. de Arcangelis, H.J. Herrmann, C. Perrone-Capano, Activity-dependent ...
158
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...