932 search results - page 5 / 187 » Uniform Random Number Generators |
SODA
1996
ACM
13 years 11 months ago
1996
ACM
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
ISAAC
2009
Springer
14 years 4 months ago
2009
Springer
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given. Based on the num...
IPL
2007
13 years 9 months ago
2007
We give a randomized algorithm (the ”Wedge Algorithm”) of competitiveness 3 2 Hk − 1 2k for any metrical task system on a uniform space of k points, for any k ≥ 2, where H...
STOC
2003
ACM
14 years 10 months ago
2003
ACM
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
GECCO
2005
Springer
14 years 3 months ago
2005
Springer
The random number generator is one of the important components of evolutionary algorithms (EAs). Therefore, when we try to solve function optimization problems using EAs, we must ...