Population-based incremental learning: Difference between revisions

Revision as of 21:44, 19 November 2014

Revision as of 01:44, 27 December 2015

Line 48:

<source lang="java">

public void optimize() {

final int totalBits = getTotalBits(domains);

final double[] probVec = new double[totalBits];

Arrays.fill(probVec, 0.5);

Line 55:

for (int i = 0; i < ITER_COUNT; i++) {

// Creates N genes

final boolean[][] genes = new boolean[N][totalBits];

for (boolean[] gene : genes) {

for (int k = 0; k < gene.length; k++) {

if (rand.nextDoublerand_nextDouble() < probVec[k])

gene[k] = true;

}