Uses of Interface
cz.cuni.mff.ksi.jinfer.iss.experiments.interfaces.Heuristics

Packages that use Heuristics

cz.cuni.mff.ksi.jinfer.iss.experiments.interfaces
cz.cuni.mff.ksi.jinfer.iss.heuristics.construction
cz.cuni.mff.ksi.jinfer.iss.heuristics.construction.fidax
cz.cuni.mff.ksi.jinfer.iss.heuristics.construction.glpk
cz.cuni.mff.ksi.jinfer.iss.heuristics.improvement

Uses of Heuristics in cz.cuni.mff.ksi.jinfer.iss.experiments.interfaces

Subinterfaces of Heuristics in cz.cuni.mff.ksi.jinfer.iss.experiments.interfaces

interface	ConstructionHeuristic Interface representing a construction heuristic.
interface	ImprovementHeuristic Interface representing an improvement heuristic.

Uses of Heuristics in cz.cuni.mff.ksi.jinfer.iss.heuristics.construction

Classes in cz.cuni.mff.ksi.jinfer.iss.heuristics.construction that implement Heuristics

class	Fuzzy This construction heuristics builds up the solution gradually by adding AMs.
class	Incremental A simple construction heuristic.
class	Null Null construction heuristics - returns nothing, an empty pool.
class	Random A trivial construction heuristics.
class	Removal A simple construction heuristic.

Uses of Heuristics in cz.cuni.mff.ksi.jinfer.iss.heuristics.construction.fidax

Classes in cz.cuni.mff.ksi.jinfer.iss.heuristics.construction.fidax that implement Heuristics

class

Fidax Construction heuristic - encapsulation of the heuristic proposed in the "Finding ID Attributes in XML Documents" article.

Uses of Heuristics in cz.cuni.mff.ksi.jinfer.iss.heuristics.construction.glpk

Classes in cz.cuni.mff.ksi.jinfer.iss.heuristics.construction.glpk that implement Heuristics

class

Glpk Construction heuristic - encapsulation of the GLPK approach to finding ID sets.

Uses of Heuristics in cz.cuni.mff.ksi.jinfer.iss.heuristics.improvement

Classes in cz.cuni.mff.ksi.jinfer.iss.heuristics.improvement that implement Heuristics

class	Crossover A slightly more complex improvement heuristic.
class	Hungry Tries to improve every solution in the pool by including as many good mappings as possible.
class	Identity This trivial improvement heuristic simply returns the provided solution pool.
class	LocalBranching This heuristic works by creating a constrained sub-problem and then solving it.
class	Mutation A slightly more complex improvement heuristic.
class	RandomRemove A simple improvement heuristic that removes a specified fraction of AMs at random from every solution in the pool.
class	RemoveWorst Simple "improvement" heuristic that works by removing the worst solution (IdSet) from the feasible pool.