|
Orbital library | |||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
| Packages that use orbital.algorithm.template | |
|---|---|
| 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. |
| Classes in orbital.algorithm.template used by orbital.algorithm.evolutionary | |
|---|---|
| AlgorithmicConfiguration
Algorithmic configurations provide the glue between a problem and an algorithm used for solving it. |
|
| AlgorithmicProblem
AlgorithmicProblem interface used for tagging hook class interfaces for algorithmic templates. |
|
| AlgorithmicTemplate
Base interface for algorithmic template frameworks. |
|
| AlgorithmicTemplate.Configuration
Default implementation of algorithmic configuration objects. |
|
| ProbabilisticAlgorithm
Tags probabilistic algorithms leading to approximative solutions. |
|
| Classes in orbital.algorithm.template used by orbital.algorithm.template | |
|---|---|
| AlgorithmicConfiguration
Algorithmic configurations provide the glue between a problem and an algorithm used for solving it. |
|
| AlgorithmicProblem
AlgorithmicProblem interface used for tagging hook class interfaces for algorithmic templates. |
|
| AlgorithmicTemplate
Base interface for algorithmic template frameworks. |
|
| AlgorithmicTemplate.Configuration
Default implementation of algorithmic configuration objects. |
|
| AStar
A* search class. |
|
| BacktrackingProblem
Hook class for Backtracking Algorithms |
|
| BestFirstSearch
BestFirstSearch class (BFS). |
|
| BranchAndBound
Branch-and-bound (B&B). |
|
| DepthFirstSearch.OptionIterator
An iterator over a state space in depth-first order. |
|
| DivideAndConquerProblem
Hook class for problems solved by DivideAndConquer. |
|
| DynamicProgrammingProblem
Hook class for problems solved by DynamicProgramming. |
|
| EvaluativeAlgorithm
Interface for evaluative algorithms. |
|
| GeneralBoundingSearch
Abstract general bounding search scheme. |
|
| GeneralSearch
Abstract general search algorithm scheme. |
|
| GeneralSearch.OptionIterator
Abstract implementation base class for iterators determining the traversal order. |
|
| GeneralSearchProblem
Hook class for GeneralSearch algorithm. |
|
| HeuristicAlgorithm
Interface for heuristic (search) algorithms. |
|
| LocalOptimizerSearch
General search scheme for local optimizing search. |
|
| LocalOptimizerSearch.LocalSelection
The local selection mechanism used to evaluate states. |
|
| MarkovDecisionProblem
Hook class for MarkovDecisionProcess algorithm. |
|
| MarkovDecisionProblem.Transition
Represents a transition option during a Markov decision process. |
|
| MarkovDecisionProcess
Markov decision process (MDP). |
|
| MarkovDecisionProcess.DynamicProgramming
Abstract base class for Markov decision processes solved per dynamic programming. |
|
| ProbabilisticAlgorithm
Tags probabilistic algorithms leading to approximative solutions. |
|
| TransitionModel
Represents a transition model. |
|
| TransitionModel.Transition
Represents (information about) a transition option during a transition model. |
|
|
Orbital library 1.2.0: 23 Apr 2008 |
|||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||