Sciweavers

1806 search results - page 70 / 362
» Randomness and halting probabilities
Sort
View
ICASSP
2011
IEEE
13 years 17 days ago
A general proof of convergence for adaptive distributed beamforming schemes
This work focuses on the convergence analysis of adaptive distributed beamforming schemes that can be reformulated as local random search algorithms via a random search framework....
Chang-Ching Chen, Chia-Shiang Tseng, Che Lin
FSS
2008
87views more  FSS 2008»
13 years 9 months ago
Representing parametric probabilistic models tainted with imprecision
Numerical possibility theory, belief function have been suggested as useful tools to represent imprecise, vague or incomplete information. They are particularly appropriate in unc...
Cédric Baudrit, Didier Dubois, Nathalie Per...
WSC
1998
13 years 10 months ago
Input Modeling Tools for Complex Problems
A simulation model is composed of inputs and logic; the inputs represent the uncertainty or randomness in the system, while the logic determines how the system reacts to the uncer...
Barry L. Nelson, Michael Yamnitsky
RSA
2010
118views more  RSA 2010»
13 years 7 months ago
Weight of a link in a shortest path tree and the Dedekind Eta function
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...
Piet Van Mieghem
STOC
2005
ACM
139views Algorithms» more  STOC 2005»
14 years 9 months ago
Spectral norm of random matrices
We study the spectral norm of matrices M that can be factored as M = BA, where A is a random matrix with independent mean zero entries and B is a fixed matrix. Under the (4 + )-th ...
Van H. Vu