Learn More
Infinite permutations of lowest maximal pattern complexity (to appear). On periodicity and low complexity of infinite permutations, Euro-pean J. Abstract. We give a short proof of Cramér's large deviations theorem based on convex duality. This proof does not resort to the law of large numbers or any other limit theorem. The most fundamental result in(More)
The set of the three dimensional polyominoes of minimal area and of volume n contains a polyomino which is the union of a quasicube j × (j + δ) × (j + θ), δ, θ ∈ {0, 1}, a quasisquare l × (l +), ∈ {0, 1}, and a bar k. This shape is naturally associated to the unique decomposition of n = j(j + δ)(j + θ) + l(l +) + k as the sum of a maximal quasicube, a(More)
Based on speculations coming from statistical mechanics and the conjectured existence of critical states, I propose a simple heuristic in order to control the mutation probability and the population size of a genetic algorithm. Genetic algorithms are widely used nowadays, as well as their cousins evolutionary algorithms. The most cited initial references on(More)
We study the simple genetic algorithm with a ranking selection mechanism (linear ranking or tournament). We denote by ℓ the length of the chromosomes, by m the population size, by pC the crossover probability and by pM the mutation probability. We introduce a parameter σ, called the selection drift, which measures the selection intensity of the fittest(More)