ExpectedUTIL.java File Reference

import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.Collection;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.List;
import org.jdom2.Element;
import frodo2.algorithms.SolutionCollector;
import frodo2.algorithms.dpop.UTILmsg;
import frodo2.algorithms.dpop.UTILpropagation;
import frodo2.algorithms.dpop.stochastic.SamplingPhase.RandVarsProjMsg;
import frodo2.algorithms.varOrdering.dfs.DFSgeneration;
import frodo2.communication.Message;
import frodo2.communication.MessageType;
import frodo2.communication.Queue;
import frodo2.solutionSpaces.Addable;
import frodo2.solutionSpaces.BasicUtilitySolutionSpace;
import frodo2.solutionSpaces.DCOPProblemInterface;
import frodo2.solutionSpaces.UtilitySolutionSpace;
import frodo2.solutionSpaces.UtilitySolutionSpace.ProjOutput;
import frodo2.solutionSpaces.hypercube.ScalarHypercube;

Include dependency graph for ExpectedUTIL.java:

Classes
class	frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > >
	E[DPOP]'s UTIL propagation phase. More...
enum	frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > >.Method
	The method to use to choose the optimal value for a variable. More...

Packages
package	frodo2.algorithms.dpop.stochastic
	Classes implementing the E[DPOP] family of algorithms for Stochastic DCOP.