Sciweavers

73 search results - page 6 / 15
» FPGA-optimised high-quality uniform random number generators
Sort
View
STOC
2003
ACM
178views Algorithms» more  STOC 2003»
14 years 7 months ago
Uniform hashing in constant time and linear space
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...
Anna Östlin, Rasmus Pagh
GRAPHICSINTERFACE
2007
13 years 8 months ago
Optimized tile-based texture synthesis
One significant problem in tile-based texture synthesis is the presence of conspicuous seams in the tiles. The reason is that the sample patches employed as primary patterns of t...
Weiming Dong, Ning Zhou, Jean-Claude Paul
TCS
2010
13 years 1 months ago
Parametric random generation of deterministic tree automata
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential l...
Pierre-Cyrille Héam, Cyril Nicaud, Sylvain ...
GECCO
2005
Springer
154views Optimization» more  GECCO 2005»
14 years 5 days ago
Genetic algorithms using low-discrepancy sequences
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 ...
Shuhei Kimura, Koki Matsumura
ISSTA
2006
ACM
14 years 20 days ago
Path-oriented random testing
Test campaigns usually require only a restricted subset of paths in a program to be thoroughly tested. As random testing (RT) offers interesting fault-detection capacities at low ...
Arnaud Gotlieb, Matthieu Petit