Orbital library

Uses of Interface
orbital.algorithm.template.AlgorithmicTemplate

Packages that use AlgorithmicTemplate
orbital.algorithm.evolutionary Genetic algorithms simulate nature on a very abstract level to get solutions for sophisticated problems. 
orbital.algorithm.template A framework for general algorithmic evaluation schemes including search and planning algorithms. 
 

Uses of AlgorithmicTemplate in orbital.algorithm.evolutionary
 

Classes in orbital.algorithm.evolutionary that implement AlgorithmicTemplate
 class ConcurrenceGeneticAlgorithm
          This class is a genetic algorithm that weights its members in comparison to the others.
 class GeneticAlgorithm
          A base class for genetic algorithms.
 class IncrementalGeneticAlgorithm
          An incremental genetic algorithm with overlapping populations and only one reproduction per generation.
 class SimpleGeneticAlgorithm
          A simple genetic algorithm with non-overlapping populations.
 class SteadyStateGeneticAlgorithm
          A steady state genetic algorithm with overlapping populations.
 

Methods in orbital.algorithm.evolutionary that return AlgorithmicTemplate
 AlgorithmicTemplate GeneticAlgorithm.Configuration.getAlgorithm()
           
 

Uses of AlgorithmicTemplate in orbital.algorithm.template
 

Subinterfaces of AlgorithmicTemplate in orbital.algorithm.template
 interface EvaluativeAlgorithm
          Interface for evaluative algorithms.
 interface HeuristicAlgorithm
          Interface for heuristic (search) algorithms.
 

Classes in orbital.algorithm.template that implement AlgorithmicTemplate
 class AStar
          A* search class.
 class Backtracking
          Framework (template class) for Backtracking Algorithms.
 class BestFirstSearch
          BestFirstSearch class (BFS).
 class BranchAndBound
          Branch-and-bound (B&B).
 class BreadthFirstSearch
          BreadthFirstSearch class (BrFS).
 class DepthFirstSearch
          DepthFirstSearch class (DFS).
 class DivideAndConquer
          Framework (template class) for Divide and Conquer Algorithms.
 class DynamicProgramming
          Framework (template class) for Dynamic Programming Algorithms.
 class GaussSeidelDynamicProgramming
          Gauß-Seidel dynamic programming.
 class GeneralBoundingSearch
          Abstract general bounding search scheme.
 class GeneralSearch
          Abstract general search algorithm scheme.
 class Greedy
          Framework (template class) for Greedy Algorithms.
 class HillClimbing
          Hill-climbing search.
 class IterativeBroadening
          Iterative Broadening (IB).
 class IterativeDeepening
          Iterative Deepening (ID).
 class IterativeDeepeningAStar
          Iterative Deepening A* (IDA*).
 class IterativeExpansion
          Iterative Expansion (IE).
 class LocalOptimizerSearch
          General search scheme for local optimizing search.
 class MarkovDecisionProcess
          Markov decision process (MDP).
static class MarkovDecisionProcess.DynamicProgramming
          Abstract base class for Markov decision processes solved per dynamic programming.
 class ParallelBranchAndBound
          Parallel branch-and-bound algorithm.
 class RealTimeDynamicProgramming
          Real-Time Dynamic Programming (RTDP).
 class SimulatedAnnealing
          Simulated Annealing (SA) search.
 class ThresholdAccepting
          Threshold Accepting (TA) search.
 class WAStar
          WA* search class.
 

Methods in orbital.algorithm.template that return AlgorithmicTemplate
 AlgorithmicTemplate HeuristicAlgorithm.Configuration.getAlgorithm()
           
 AlgorithmicTemplate AlgorithmicTemplate.Configuration.getAlgorithm()
           
 AlgorithmicTemplate AlgorithmicConfiguration.getAlgorithm()
          Gets the algorithm used for solving the problem.
 


Orbital library
1.3.0: 11 Apr 2009

Copyright © 1996-2009 André Platzer
All Rights Reserved.