Overview
Package
Class
Use
Tree
Deprecated
Index
Help
PREV LETTER
NEXT LETTER
FRAMES
NO FRAMES
All Classes
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
R
S
T
U
V
W
C
cacheInsert(int, int, double)
- Method in class lio.util.
HierPartition
Inserts an entry in the cache.
cacheValue(int)
- Method in class lio.util.
HierPartition
Returns the value of the cache entry in position index
calculateConstraint()
- Static method in class lio.search.pso.contchain.
StdContParticle
Calculates the constraint in case the parameter is equal to 0 by using clerc's formula.
calculateMaxVelocities()
- Static method in class lio.search.pso.contchain.
StdContParticle
Calculates the maxVelocity for each component of the particle as a proportion of the range.
Chain
- Class in
lio.probdistributions.bitchain
Learns a bivariate model from bitChains where each node can have only one child.
Chain()
- Constructor for class lio.probdistributions.bitchain.
Chain
change()
- Method in class lio.individuals.
Individual
Notifies a change in the individual's data.
ChartWindow
- Class in
lio.gui
ChartWindow()
- Constructor for class lio.gui.
ChartWindow
ChartWindow(int)
- Constructor for class lio.gui.
ChartWindow
CHC
- Class in
lio.search.genetic
Implement the CHC Adaptive Search Algorithm proposed by L.J.
CHC()
- Constructor for class lio.search.genetic.
CHC
Creates a new instance of StdGeneticAlgorithm
checkCompatibility(String, String)
- Method in class lio.core.
LiOConfiguration
Tells whether the resource is available for a given kind of data.
checkCompatibility(String)
- Method in class lio.core.
LiOConfiguration
Returns true if the class that implements this resource is available for the kind of data that uses the task.
CheckerBoard
- Class in
problems.bitchain
Implements the CheckerBoard problem whose optimum is an string with no consecutive positions with the same value.
CheckerBoard()
- Constructor for class problems.bitchain.
CheckerBoard
cleanExecution()
- Method in class lio.search.
LiOSearch
This method should be invoked as the last action in the algorithm execution.
clone()
- Method in class lio.individuals.
BitChain
clone()
- Method in class lio.individuals.
ContChain
clone()
- Method in class lio.individuals.
Individual
Clones an individual.
clone()
- Method in class lio.individuals.
Permutation
cognitive
- Static variable in class lio.search.pso.contchain.
StdContParticle
Cognitive component of velocity updating.
Colville
- Class in
problems.bitchain
Implements the Colville function for binary representations.
Colville()
- Constructor for class problems.bitchain.
Colville
Colville
- Class in
problems.contchain
Implements the Colville problems for real problems.
Colville()
- Constructor for class problems.contchain.
Colville
comparePopulations(Population, Population)
- Static method in class lio.util.
Utils
Compares two populations.
compareTo(Object)
- Method in class lio.individuals.
Individual
Compares this Individual with the specified individual for order.
compress()
- Method in class lio.population.
VariablePopulation
Deletes all empty positions of the population.
conditionals
- Variable in class lio.probdistributions.bitchain.
BivariateProbDistribution
Conditional probabilities of each variable.
configureSearchA()
- Method in class lio.gui.
LiOGui
configureSearchOutput()
- Method in class lio.gui.
LiOGui
configureStopCondition()
- Method in class lio.gui.
LiOGui
configureTask()
- Method in class lio.gui.
LiOGui
constraint
- Static variable in class lio.search.pso.contchain.
StdContParticle
Constraint for velocity updating
ConstraintGroup
- Class in
lio.gui
ConstraintGroup(int[][], double[][])
- Constructor for class lio.gui.
ConstraintGroup
ContChain
- Class in
lio.individuals
This class is used to manage individuals represented by an array of double.
ContChain(double[])
- Constructor for class lio.individuals.
ContChain
Creates a new instance of ContChain from an array of double.
ContChain(int)
- Constructor for class lio.individuals.
ContChain
Creates a new instance of permutation using the positions as values.
ContChainBounds
- Class in
lio.individuals
Represents the boundaries for each variable in a problem represented by a chain of real values.
ContChainBounds(int)
- Constructor for class lio.individuals.
ContChainBounds
Constructor
ContChainBounds(int, double, double)
- Constructor for class lio.individuals.
ContChainBounds
Constructor
ContinuousProbDistribution
- Class in
lio.probdistributions.contchain
This class implements the common features and data structures for continuous probability distributions.
ContinuousProbDistribution()
- Constructor for class lio.probdistributions.contchain.
ContinuousProbDistribution
CONVERGENCEVEL
- Static variable in class lio.gui.
ChartWindow
convexCombination(double[], double)
- Method in class lio.probdistributions.bitchain.
MarginalProbabilityVector
Updates the probability vector by doing the convex combination with the one recevied a parameter.
convexCombination(MarginalProbabilityVector, double)
- Method in class lio.probdistributions.bitchain.
MarginalProbabilityVector
Updates the probability vector by doing the convex combination with the one recevied a parameter.
copyElementAt(int)
- Method in class lio.population.
Population
Returns a copy of the element at the given position.
createFromFile(String)
- Method in class lio.core.
LiOResourceFactory
Tries to create a new instance of an object from a path to .class file or a full qualified class name.
createResource(String)
- Method in class lio.core.
LiOResourceFactory
Returns the default resource given by either configuration file or default file in that order.
createResource(String, String)
- Method in class lio.core.
LiOResourceFactory
Returns the resource by looking for a concrete instantiation, but if isn't possible then returns the default resource.
createResource()
- Method in class lio.core.
ResourceConfiguration
This method returns a resource represented in this object with all its values.
createSearchAlgorithm(String)
- Method in class lio.core.
LiOResourceFactory
Create the search algorithm encode in the class name passed as argument
createStructures(int)
- Method in class lio.probdistributions.bitchain.
BivariateProbDistribution
Creates the necessary structures for the search.
createStructures(int)
- Method in class lio.probdistributions.bitchain.
Tree
Creates the necessary structures for the search.
cross(Individual, Individual)
- Method in class lio.crossover.bitchain.
HUX
Crosses two individuals.
cross(Individual, Individual)
- Method in class lio.crossover.bitchain.
OnePointCrossover
Crosses two individuals.
cross(Individual, Individual)
- Method in class lio.crossover.bitchain.
TwoPointCrossover
Crosses two individuals.
cross(Individual, Individual)
- Method in class lio.crossover.bitchain.
UniformCrossover
Crosses two individuals.
cross(Individual, Individual)
- Method in class lio.crossover.contchain.
ArithmeticalCrossover
Crosses two individuals.
cross(Individual, Individual)
- Method in class lio.crossover.contchain.
BLXAlphaCrossover
Crosses two individuals.
cross(Individual, Individual)
- Method in class lio.crossover.contchain.
DiscreteCrossover
Crosses two individuals.
cross(Individual, Individual)
- Method in class lio.crossover.contchain.
ExtendedIntermediateCrossover
Crosses two individuals.
cross(Individual, Individual)
- Method in class lio.crossover.contchain.
ExtendedLineCrossover
Crosses two individuals.
cross(Individual, Individual)
- Method in class lio.crossover.contchain.
FlatCrossover
Crosses two individuals.
cross(Individual, Individual)
- Method in class lio.crossover.contchain.
LinearCrossover
Crosses two individuals.
cross(Individual, Individual)
- Method in class lio.crossover.contchain.
SimpleCrossover
Crosses two individuals.
cross(Individual, Individual)
- Method in class lio.crossover.contchain.
WrightsHeuristicCrossover
Crosses two individuals.
cross(Individual, Individual)
- Method in interface lio.crossover.
Crossover
Crosses two individuals.
cross(Individual, Individual)
- Method in class lio.crossover.permutations.
OrderCrossover
Crosses two individuals.
cross(Individual, Individual)
- Method in class lio.crossover.permutations.
PMX
Crosses two individuals.
Crossover
- Interface in
lio.crossover
Simple crossover operator.
currentIndividual
- Variable in class lio.search.local.greedy.
GRASP
currentPosition
- Variable in class lio.search.pso.
Particle
Current position and fitness of the particle
Overview
Package
Class
Use
Tree
Deprecated
Index
Help
PREV LETTER
NEXT LETTER
FRAMES
NO FRAMES
All Classes
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
R
S
T
U
V
W