Package org.uncommons.maths.random

Examples of org.uncommons.maths.random.PoissonGenerator

136
137
138
139
140
141
142
143
144
145
146
    List<EvolutionaryOperator<List<String>>> operators = new ArrayList<EvolutionaryOperator<List<String>>>(2);
    if (crossover) {
      operators.add(new ListOrderCrossover());
    }
    if (mutation) {
      operators.add(new ListOrderMutation(new PoissonGenerator(1.5, rng), new PoissonGenerator(1.5, rng)));
    }
   
    EvolutionaryOperator<List<String>> pipeline = new EvolutionPipeline<List<String>>(operators);
   
    CandidateFactory<List<String>> candidateFactory = new ListPermutationFactory<String>(
View Full Code Here
69
70
71
72
73
74
75

   
    protected PoissonGenerator createValueGenerator(Random rng)
    {
        return new PoissonGenerator(mean, rng);
    }
View Full Code Here
134
135
136
137
138
139
140
141
142
143
144
    List<EvolutionaryOperator<List<String>>> operators = new ArrayList<EvolutionaryOperator<List<String>>>(2);
    if (crossover) {
      operators.add(new ListOrderCrossover());
    }
    if (mutation) {
      operators.add(new ListOrderMutation(new PoissonGenerator(1.5, rng), new PoissonGenerator(1.5, rng)));
    }
   
    EvolutionaryOperator<List<String>> pipeline = new EvolutionPipeline<List<String>>(operators);
   
    CandidateFactory<List<String>> candidateFactory = new ListPermutationFactory<String>(
View Full Code Here
134
135
136
137
138
139
140
141
142
143
144
    List<EvolutionaryOperator<List<String>>> operators = Lists.newArrayListWithCapacity(2);
    if (crossover) {
      operators.add(new ListOrderCrossover());
    }
    if (mutation) {
      operators.add(new ListOrderMutation(new PoissonGenerator(1.5, rng), new PoissonGenerator(1.5, rng)));
    }
   
    EvolutionaryOperator<List<String>> pipeline = new EvolutionPipeline<List<String>>(operators);
   
    CandidateFactory<List<String>> candidateFactory = new ListPermutationFactory<String>(
View Full Code Here
136
137
138
139
140
141
142
143
144
145
146
147
        2);
    if (crossover) {
      operators.add(new ListOrderCrossover());
    }
    if (mutation) {
      operators.add(new ListOrderMutation(new PoissonGenerator(1.5, rng),
          new PoissonGenerator(1.5, rng)));
    }

    EvolutionaryOperator<List<?>> pipeline = new EvolutionPipeline<List<?>>(
        operators);
View Full Code Here
135
136
137
138
139
140
141
142
143
144
145
146
    List<EvolutionaryOperator<List<String>>> operators = new ArrayList<EvolutionaryOperator<List<String>>>(2);
    if (crossover) {
      operators.add(new ListOrderCrossover());
    }
    if (mutation) {
      operators.add(new ListOrderMutation(new PoissonGenerator(1.5, rng),
          new PoissonGenerator(1.5, rng)));
    }

    EvolutionaryOperator<List<String>> pipeline = new EvolutionPipeline<List<String>>(operators);

    CandidateFactory<List<String>> candidateFactory = new ListPermutationFactory<String>(
View Full Code Here
216
217
218
219
220
221
222
223
224
225
226
                List<EvolutionaryOperator<Sudoku>> operators = new ArrayList<EvolutionaryOperator<Sudoku>>(2);
                // Cross-over rows between parents (so offspring is x rows from parent1 and
                // y rows from parent2).
                operators.add(new SudokuVerticalCrossover());
                // Mutate the order of cells within individual rows.
                operators.add(new SudokuRowMutation(new PoissonGenerator(2, rng),
                                                    new DiscreteUniformGenerator(1, 8, rng)));

                EvolutionaryOperator<Sudoku> pipeline = new EvolutionPipeline<Sudoku>(operators);

                EvolutionEngine<Sudoku> engine = new GenerationalEvolutionEngine<Sudoku>(new SudokuFactory(puzzle),
View Full Code Here
119
120
121
122
123
124
125
126
127
128
129
130
        {
            operators.add(new ListOrderCrossover<String>());
        }
        if (mutation)
        {
            operators.add(new ListOrderMutation<String>(new PoissonGenerator(1.5, rng),
                                                        new PoissonGenerator(1.5, rng)));
        }

        EvolutionaryOperator<List<String>> pipeline = new EvolutionPipeline<List<String>>(operators);

        CandidateFactory<List<String>> candidateFactory
View Full Code Here
TOP

Related Classes of org.uncommons.maths.random.PoissonGenerator

  • org.apache.mahout.ga.watchmaker.travellingsalesman.EvolutionaryTravellingSalesman
  • org.uncommons.maths.demo.PoissonDistribution
  • org.uncommons.watchmaker.examples.sudoku.SudokuApplet
  • org.uncommons.watchmaker.examples.travellingsalesman.EvolutionaryTravellingSalesman
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.