|
|||||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
See:
Description
Interface Summary | |
IntegerSelector | Interface to implement to control the selection of values when reducing integer domains. |
LocalSearch | Interface for a class that creates and returns common local search actions and objects that can be used to build searches |
LongSelector | Interface to implement to control the selection of values when reducing long domains. |
Metaheuristic | Used to guide a local search regarding which moves can be taken. |
Neighborhood | Contains a set of neighboring solutions that are related to an initial solution. |
Search | Search objects are defined to control the order in which search operations are performed when executing actions such as generating variables. |
SearchAction | This class is used by the search tree to build search nodes. |
SearchActions | Interface for a class that returns common search actions that can be used to locate solutions to a CSP problem |
SearchGoal | Interface implemented by classes that are used to guide searches towards specific solutions such as solutions that minimizes a specified expression. |
SearchGoals | Interface implemented by a class that creates and returns common search goals that can be used to build a search for locating specific solutions in a CSP problem |
SearchLimit | This class is used by the search tree to limit the number of nodes of the search tree that are actually activated to keep the size of the search tree limited. |
SearchLimits | Interface for a class that returns common search limits that can be used to control searching in a CSP problem |
SearchManager | Interface for a class that will return classes that are used to build a search plan for locating solutions to a CSP problem |
SearchNode | A SearchNode is a portion of the search tree that is
processed by a Search algorithm. |
SearchNodeReference | Represents a reference to a node that can be stored and later returned to in a tree |
SearchTechnique | Objects of this type control how the search tree is iterated over during the solver's search routine. |
SearchTechniques | Creates and returns common search techniques that can be used to traverse a search tree when attempting to locate solutions for a CSP problem |
SetSelector | Interface to implement to control the selection of values when reducing set domains. |
Class Summary | |
CurrentNeighbor | Used to hold a neighboring solution and the neighborhood that produced it. |
RandomizedNeighborhood | A simple wrapper to other neighborhoods that randomizes the order in which neighbors are obtained. |
SimpleNeighborhood | A simple collection of neighboring solutions that are predefined and capable of being browsed during a search. |
UnifiedNeighborhood | Creates a neighborhood based on a combination of other neighborhoods. |
WeightedRandomizedNeighborhood | A wrapper to other neighborhoods that returns neighbors from the wrapped neighborhoods in a random, weighted manner. |
The interfaces to all your searching needs.
Defines several interfaces (and some implementations) related to searching. This includes interfaces for classes defining common search actions such as storing solutions or adding constraints, common search techniques like breadth-first or depth-first, search goals like maximize or minimize, and search limits based on elapsed time, number of failures, or other criteria. Also defines required operations for metaheuristics and neighborhoods - two essential elements of local searching - in addition to a variety of other search-related resources.
|
|||||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |