frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLeaves< V extends Addable< V >, U extends Addable< U > > Class Template Reference

The version of the SamplingPhase that samples at the leaves. More...

Inheritance diagram for frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLeaves< V extends Addable< V >, U extends Addable< U > >:

Public Member Functions
	AtLeaves ()
	Empty constructor.
	AtLeaves (Element parameters, DCOPProblemInterface< V, U > problem)
	Constructor in statistics gatherer mode.
	AtLeaves (DCOPProblemInterface< V, U > problem, Element parameters)
	Constructor.
void	notifyIn (Message msg)
Public Member Functions inherited from frodo2.algorithms.dpop.stochastic.SamplingPhase< V, U >
void	reset ()
Collection< MessageType >	getMsgTypes ()
void	notifyIn (Message msg)
void	getStatsFromQueue (Queue queue)
void	setSilent (boolean silent)
String	dfsToString ()

Protected Member Functions
void	init ()
Protected Member Functions inherited from frodo2.algorithms.dpop.stochastic.SamplingPhase< V, U >
	SamplingPhase ()
	Nullary constructor.
void	init ()
	Parses the problem.

Private Attributes
HashSet< String >	sampledVars = new HashSet<String> ()
	The set of random variables that have already been sampled.

Additional Inherited Members
Static Public Attributes inherited from frodo2.algorithms.dpop.stochastic.SamplingPhase< V, U >
static MessageType	START_MSG_TYPE
	The type of the start message.
static final MessageType	RAND_VARS_PROJ_MSG_TYPE
	The type of the messages telling what random variables should be projected out at given decision variable.
Protected Attributes inherited from frodo2.algorithms.dpop.stochastic.SamplingPhase< V, U >
DCOPProblemInterface< V, U >	problem
	The problem.
boolean	started
	Whether the execution of the algorithm has started.
int	nbrSamples
	The number of samples for each random variable.
HashMap< String, UtilitySolutionSpace< V, U > >	probLaws
	For each random variable, its non-sampled probability law.
boolean	reportStats
	Whether to report stats.
WhereToProject	proj
	Where the random variables should be projected out.

Detailed Description

The version of the SamplingPhase that samples at the leaves.

Parameters

<V>	the type used for variable values
<U>	the type used for utility values

Constructor & Destructor Documentation

AtLeaves() [1/3]

frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLeaves< V extends Addable< V >, U extends Addable< U > >.AtLeaves

(

)

Empty constructor.

AtLeaves() [2/3]

frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLeaves< V extends Addable< V >, U extends Addable< U > >.AtLeaves	(	Element	parameters,
		DCOPProblemInterface< V, U >	problem )

Constructor in statistics gatherer mode.

Parameters

problem	the overall problem
parameters	the parameters

References frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.WhereToProject.LEAVES, and frodo2.algorithms.dpop.stochastic.SamplingPhase< V, U >.problem.

AtLeaves() [3/3]

frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLeaves< V extends Addable< V >, U extends Addable< U > >.AtLeaves	(	DCOPProblemInterface< V, U >	problem,
		Element	parameters )

Constructor.

Parameters

problem	the problem
parameters	the parameters

References frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.WhereToProject.LEAVES, and frodo2.algorithms.dpop.stochastic.SamplingPhase< V, U >.problem.

Member Function Documentation

init()

void frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLeaves< V extends Addable< V >, U extends Addable< U > >.init ( )

protected

See also

SamplingPhase.init()

References frodo2.algorithms.dpop.stochastic.SamplingPhase< V, U >.problem, frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.queue, frodo2.algorithms.dpop.stochastic.SamplingPhase< V, U >.randVars, and frodo2.algorithms.AgentInterface< V extends Addable< V > >.STATS_MONITOR.

Referenced by notifyIn().

notifyIn()

void frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLeaves< V extends Addable< V >, U extends Addable< U > >.notifyIn

(

Message

msg

)

See also

SamplingPhase.notifyIn(Message)

References frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.DFS_MSG_TYPE, frodo2.communication.MessageType.equals(), frodo2.communication.Message.getType(), and init().

Here is the call graph for this function:

Member Data Documentation

sampledVars

HashSet<String> frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLeaves< V extends Addable< V >, U extends Addable< U > >.sampledVars = new HashSet<String> ()

private

The set of random variables that have already been sampled.

---

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

• src/frodo2/algorithms/dpop/stochastic/SamplingPhase.java