|
||||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
See:
Description
Interface Summary | |
---|---|
BidirectionalProblem<T> | This is the base of all problems which can be solved in the bidirectional search. |
HillClimbingProblem<T> | This is the base of all problems which can be solved with the hill climbing search. |
HillClimbingStrategy<T> | This is the base of all strategies for the hill climbing search. |
SimulatedAnnealingProblem<T> | This is the base of all problems which can be solved with the simulated annealing search. |
Class Summary | |
---|---|
BestChoiceStrategy<T> | A hill climbing strategy which selects the best successor upon all successor states. |
BidirectionalSearch<T> | The bidirectional search algorithm is a special blind search able to solve any problem implementing the core.BidirectionalProblem interface. |
FirstChoiceStrategy<T> | A hill climbing strategy which selects the first successor which is better then the current state. |
HillClimbing<T> | The hill climbing algorithm is simple local search able to solve any problem implementing the extended.HillClimbingProblem interface. |
SimulatedAnnealing<T> | The simulated annealing search is an advanced local search able to solve any problem implementing the extended.SimulatedAnnealingProblem interface. |
Enum Summary | |
---|---|
HillClimbing.EStrategy | Enumeration to select one of the two default hill climbing strategies. |
contains more advanced search algorithms and the corresponding problem interfaces
|
||||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |