10 citations · 10 across the 6 of their papers we have counts for
6 papers
Optimizing Genetic Algorithms Using the Binomial Distribution
Vincent A. Cicirello
Evolutionary algorithms rely very heavily on randomized behavior. Execution speed, therefore, depends strongly on how we implement randomness, such as our choice of pseudorandom nu…
Open Source Evolutionary Computation with Chips-n-Salsa
Vincent A. Cicirello
When it was first introduced, the Chips-n-Salsa Java library provided stochastic local search and related algorithms, with a focus on self-adaptation and parallel execution. For th…
Fast Gaussian Distributed Pseudorandom Number Generation in Java via the Ziggurat Algorithm
Vincent A. Cicirello
We report on experiments with the ziggurat algorithm for generating Gaussian distributed random numbers. The study utilizes our open source Java implementation that was introduced…
Algorithms for Generating Small Random Samples
Vincent A. Cicirello
We present algorithms for generating small random samples without replacement. We consider two cases. We present an algorithm for sampling a pair of distinct integers, and an algor…
On the Average Runtime of an Open Source Binomial Random Variate Generation Algorithm
Vincent A. Cicirello
The BTPE algorithm (Binomial, Triangle, Parallelogram, Exponential) of Kachitvichyanukul and Schmeiser is one of the faster and more widely utilized algorithms for generating binom…
A Survey and Analysis of Evolutionary Operators for Permutations
Vincent A. Cicirello
There are many combinatorial optimization problems whose solutions are best represented by permutations. The classic traveling salesperson seeks an optimal ordering over a set of c…