frodo2.algorithms.duct.SamplingPruning< V extends Addable< V > >.VariableInfo Class Reference

Convenience class to hold variable information. More...

Inheritance diagram for frodo2.algorithms.duct.SamplingPruning< V extends Addable< V > >.VariableInfo:

Public Member Functions
	VariableInfo (String variableID, V[] domain, String parent, List< String > children, Class< SamplingProcedure< V > > samplingClass, Class< TerminationCondition< V > > terminationClass)
	Constructor.
boolean	setContext (String sender, String[] variables, V[] values)
	Method used to update the context after a VALUE message has been received.
AddableReal	solveLeaf ()
	Solve the local problem of a leaf, given the context.
boolean	storeCOSTmsg (COSTmsg msg)

Protected Member Functions
SearchNode< V >	createNode (int domainSize, boolean maximize, boolean IGNORE_INF)

Detailed Description

Convenience class to hold variable information.

Author

Brammert Ottens, 7 jul. 2011

Constructor & Destructor Documentation

VariableInfo()

frodo2.algorithms.duct.SamplingPruning< V extends Addable< V > >.VariableInfo.VariableInfo	(	String	variableID,
		V[]	domain,
		String	parent,
		List< String >	children,
		Class< SamplingProcedure< V > >	samplingClass,
		Class< TerminationCondition< V > >	terminationClass )

Constructor.

Parameters

variableID	the name of the variable
domain	the domain of the variable
parent	the parent of the variable
children	list of the children of the variable
samplingClass	the class of the sampling method
terminationClass	the class of the termination condition

References frodo2.algorithms.duct.Sampling< V >.samplingClass, and frodo2.algorithms.duct.Sampling< V >.terminationClass.

Member Function Documentation

createNode()

SearchNode< V > frodo2.algorithms.duct.SamplingPruning< V extends Addable< V > >.VariableInfo.createNode ( int domainSize, boolean maximize, boolean IGNORE_INF )

protected

See also

frodo2.algorithms.duct.Sampling.VariableInfo.createNode(int, boolean, boolean)

References frodo2.algorithms.duct.Sampling< V >.IGNORE_INF, and frodo2.algorithms.duct.Sampling< V >.maximize.

Referenced by setContext().

setContext()

boolean frodo2.algorithms.duct.SamplingPruning< V extends Addable< V > >.VariableInfo.setContext	(	String	sender,
		String[]	variables,
		V[]	values )

Method used to update the context after a VALUE message has been received.

Author

Brammert Ottens, 7 jul. 2011

Parameters

sender	the sender of the VALUE message
variables	the reported variables
values	the context as reported by the parent

Returns

true when local problem has at least one feasible solution, false otherwise

References createNode(), frodo2.algorithms.duct.Sampling< V >.IGNORE_INF, frodo2.algorithms.duct.Sampling< V >.infeasibleUtility, frodo2.algorithms.duct.SearchNode< V extends Addable< V > >.initSampling(), and frodo2.algorithms.duct.Sampling< V >.maximize.

Referenced by frodo2.algorithms.duct.SamplingPruning< V extends Addable< V > >.notifyIn().

Here is the call graph for this function:

solveLeaf()

AddableReal frodo2.algorithms.duct.SamplingPruning< V extends Addable< V > >.VariableInfo.solveLeaf

(

)

Solve the local problem of a leaf, given the context.

Author

Brammert Ottens, 29 aug. 2011

Returns

the maximal utility obtainable given the context

References frodo2.solutionSpaces.AddableReal.compareTo(), frodo2.algorithms.duct.Sampling< V >.infeasibleUtility, and frodo2.algorithms.duct.Sampling< V >.maximize.

Referenced by frodo2.algorithms.duct.SamplingPruning< V extends Addable< V > >.notifyIn().

Here is the call graph for this function:

storeCOSTmsg()

boolean frodo2.algorithms.duct.SamplingPruning< V extends Addable< V > >.VariableInfo.storeCOSTmsg

(

COSTmsg

msg

)

Author

Brammert Ottens, 7 jul. 2011

Parameters

msg	the message to be stored

Returns

true when enough cost messages have been received, false otherwise

References frodo2.solutionSpaces.AddableReal.add(), frodo2.algorithms.duct.COSTmsg.getCost(), frodo2.algorithms.duct.Sampling< V >.infeasibleUtility, frodo2.algorithms.duct.Sampling< V >.maximize, and frodo2.algorithms.duct.Sampling< V >.penalty.

Referenced by frodo2.algorithms.duct.SamplingPruning< V extends Addable< V > >.notifyIn().

Here is the call graph for this function:

---

The documentation for this class was generated from the following file:

• src/frodo2/algorithms/duct/SamplingPruning.java