627 search results - page 6 / 126 » Kolmogorov-Loveland Randomness and Stochasticity |
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract-- We study the convergence rate of average consensus algorithms in networks with stochastic communication failures. We show how the system dynamics can be modeled by a dis...
AAAI
2011
12 years 7 months ago
2011
We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size - two parameters known to bound the complexity...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...
ALT
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts
TSP
2011
13 years 2 months ago
2011
Abstract—We introduce an extended family of continuous-domain stochastic models for sparse, piecewise-smooth signals. These are specified as solutions of stochastic differential...