Searched defs:population (Results 1 - 12 of 12) sorted by relevance

/external/apache-commons-math/src/main/java/org/apache/commons/math/genetics/
H A DSelectionPolicy.java20 * 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 DStoppingCondition.java27 * 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 DChromosome.java20 * 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 DFixedGenerationCount.java52 * @param population ignored (no impact on result)
55 public boolean isSatisfied(Population population) { argument
H A DTournamentSelection.java25 * 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/brotli/c/enc/
H A Dbit_cost.h21 static BROTLI_INLINE double ShannonEntropy(const uint32_t *population, argument
25 const uint32_t *population_end = population + size;
30 while (population < population_end) {
31 p = *population++;
35 p = *population++;
45 const uint32_t *population, size_t size) {
47 double retval = ShannonEntropy(population, size, &sum);
44 BitsEntropy( const uint32_t *population, size_t size) argument
/external/icu/icu4j/samples/src/com/ibm/icu/samples/iuc/
H A DPopulationData.java26 * Entry in the population list
30 private double population; field in class:PopulationData.TerritoryEntry
31 public TerritoryEntry(String displayCountry, double population) { argument
33 this.population = population;
38 public double population() { method in class:PopulationData.TerritoryEntry
39 return population;
47 if (rc==0) rc = ((Double)population).compareTo(o.population());
62 // territoryF = { gdp, literacy, population }
[all...]
/external/webp/src/dsp/
H A Dlossless_enc_mips32.c98 // const uint32_t* pop = &population[4];
99 // const uint32_t* LoopEnd = &population[length];
107 static double ExtraCost_MIPS32(const uint32_t* const population, int length) { argument
109 const uint32_t* pop = &population[4];
110 const uint32_t* const LoopEnd = &population[length];
H A Dlossless_enc.c615 static double ExtraCost_C(const uint32_t* population, int length) { argument
618 for (i = 2; i < length - 2; ++i) cost += (i >> 1) * population[i + 2];
/external/webp/src/enc/
H A Dhistogram_enc.c242 // Get the symbol entropy for the distribution 'population'.
244 static double PopulationCost(const uint32_t* const population, int length, argument
248 VP8LGetEntropyUnrefined(population, length, &bit_entropy, &stats);
/external/annotation-tools/asmx/test/lib/
H A Dsaxon7.jarMETA-INF/ META-INF/MANIFEST.MF net/sf/saxon/Compile.class Compile.java package ...
/external/conscrypt/benchmark-android/
H A Dvogar.jarMETA-INF/ META-INF/MANIFEST.MF vogar/ vogar/TestProperties.class TestProperties.java package vogar ...

Completed in 910 milliseconds