Searched defs:population (Results 1 - 8 of 8) sorted by relevance
/external/apache-commons-math/src/main/java/org/apache/commons/math/genetics/ |
H A D | SelectionPolicy.java | 20 * Algorithm used to select a chromosome pair from a population. 27 * Select two chromosomes from the population. 28 * @param population the population from which the chromosomes are choosen. 31 ChromosomePair select(Population population); argument
|
H A D | StoppingCondition.java | 27 * Determine whether or not the given population satisfies the stopping 30 * @param population the population to test. 32 * given population. <code>false</code> otherwise. 34 boolean isSatisfied(Population population); argument
|
H A D | Chromosome.java | 20 * Individual in a population. Chromosomes are compared based on their fitness. 80 * Searches the <code>population</code> for another chromosome with the same 84 * @param population 89 protected Chromosome findSameChromosome(Population population) { argument 90 for (Chromosome anotherChr : population) { 98 * Searches the population for a chromosome representing the same solution, 101 * @param population 104 public void searchForFitnessUpdate(Population population) { argument 105 Chromosome sameChromosome = findSameChromosome(population);
|
H A D | FixedGenerationCount.java | 52 * @param population ignored (no impact on result) 55 public boolean isSatisfied(Population population) { argument
|
H A D | TournamentSelection.java | 25 * chromosomes without replacement from the population, and then selecting the 47 * Select two chromosomes from the population. Each of the two selected 50 * population, and then selecting the fittest chromosome among them. 52 * @param population 53 * the population from which the chromosomes are choosen. 56 public ChromosomePair select(Population population) { argument 58 tournament((ListPopulation) population), 59 tournament((ListPopulation)population) 65 * chromosomes without replacement from the population, and then select the 68 * @param population 72 tournament(ListPopulation population) argument [all...] |
/external/webp/src/dsp/ |
H A D | lossless_mips32.c | 101 // const uint32_t* pop = &population[4]; 102 // const uint32_t* LoopEnd = &population[length]; 110 static double ExtraCost(const uint32_t* const population, int length) { argument 112 const uint32_t* pop = &population[4]; 113 const uint32_t* const LoopEnd = &population[length]; 220 static VP8LStreaks HuffmanCostCount(const uint32_t* population, int length) { argument 230 if (population[i] == population[i + 1]) { 233 temp0 = (population[i] != 0); 238 temp0 = (population[ [all...] |
H A D | lossless.c | 1463 static double ExtraCost(const uint32_t* population, int length) { argument 1466 for (i = 2; i < length - 2; ++i) cost += (i >> 1) * population[i + 2]; 1482 static VP8LStreaks HuffmanCostCount(const uint32_t* population, int length) { argument 1489 if (population[i] == population[i + 1]) { 1492 stats.counts[population[i] != 0] += (streak > 3); 1493 stats.streaks[population[i] != 0][(streak > 3)] += streak; 1497 stats.counts[population[i] != 0] += (streak > 3); 1498 stats.streaks[population[i] != 0][(streak > 3)] += streak;
|
/external/webp/src/enc/ |
H A D | histogram.c | 243 static double HuffmanCost(const uint32_t* const population, int length) { argument 244 const VP8LStreaks stats = VP8LHuffmanCostCount(population, length); 255 static double PopulationCost(const uint32_t* const population, int length) { argument 256 return BitsEntropy(population, length) + HuffmanCost(population, length);
|
Completed in 165 milliseconds