Sciweavers

932 search results - page 25 / 187
» Uniform Random Number Generators
Sort
View
DLT
2003
14 years 11 months ago
Frequency of Symbol Occurrences in Simple Non-primitive Stochastic Models
We study the random variable Yn representing the number of occurrences of a given symbol in a word of length n generated at random. The stochastic model we assume is a simple non-e...
Diego de Falco, Massimiliano Goldwurm, Violetta Lo...
CCA
2000
Springer
15 years 2 months ago
The Uniformity Conjecture
The Exact Geometric Computing approach requires a zero test for numbers which are built up using standard operations starting with the natural numbers. The uniformity conjecture, ...
Daniel Richardson
ICST
2010
IEEE
14 years 8 months ago
Generating Transition Probabilities for Automatic Model-Based Test Generation
—Markov chains with Labelled Transitions can be used to generate test cases in a model-based approach. These test cases are generated by random walks on the model according to pr...
Abderrahmane Feliachi, Hélène Le Gue...
AUTOMATICA
2002
93views more  AUTOMATICA 2002»
14 years 9 months ago
A probabilistic framework for problems with real structured uncertainty in systems and control
The objective of this paper is twofold. First, the problem of generation of real random matrix samples with uniform distribution in structured (spectral) norm bounded sets is stud...
Giuseppe Carlo Calafiore, Fabrizio Dabbene
ISAAC
2005
Springer
123views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Sampling Unlabeled Biconnected Planar Graphs
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang