Sciweavers

2354 search results - page 18 / 471
» Randomness, Stochasticity and Approximations
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Optimal wireless networks based on local channel state information
We consider distributed algorithms to optimize random access multihop wireless networks in the presence of fading. Since the associated optimization problem is neither convex nor ...
Yichuan Hu, Alejandro Ribeiro
COCO
2003
Springer
93views Algorithms» more  COCO 2003»
14 years 28 days ago
The complexity of stochastic sequences
We review and slightly strengthen known results on the Kolmogorov complexity of prefixes of effectively random sequences. First, there are recursively random random sequences su...
Wolfgang Merkle
SIAMCO
2000
117views more  SIAMCO 2000»
13 years 7 months ago
The O.D.E. Method for Convergence of Stochastic Approximation and Reinforcement Learning
It is shown here that stability of the stochastic approximation algorithm is implied by the asymptotic stability of the origin for an associated ODE. This in turn implies convergen...
Vivek S. Borkar, Sean P. Meyn
CDC
2010
IEEE
13 years 2 months ago
Stochastic approximation for consensus with general time-varying weight matrices
This paper considers consensus problems with delayed noisy measurements, and stochastic approximation is used to achieve mean square consensus. For stochastic approximation based c...
Minyi Huang
ICPR
2010
IEEE
13 years 5 months ago
Efficient Polygonal Approximation of Digital Curves via Monte Carlo Optimization
A novel stochastic searching scheme based on the Monte Carlo optimization is presented for polygonal approximation (PA) problem. We propose to combine the split-and-merge based lo...
Xiuzhuang Zhou, Yao Lu