| DFS_MSG_TYPE | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | static |
| ExpectedUTIL(DCOPProblemInterface< Val, U > problem, Element parameters) | frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > > | |
| ExpectedUTIL(Element parameters, DCOPProblemInterface< Val, U > problem) | frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > > | |
| expectedUtil | frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > > | private |
| finalTime | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | private |
| FINISH_MSG_TYPE | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | static |
| getDFSMsgType() | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | |
| getExpectedUtil() | frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > > | |
| getFinalTime() | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | |
| getMaxMsgDim() | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | |
| getMsgTypes() | frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > > | |
| getOptUtil() | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | |
| getProbOfOptimality() | frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > > | |
| getSolution() | frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > > | |
| getStartMsgType() | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | |
| getStatsFromQueue(Queue queue) | frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > > | |
| getWorstUtil() | frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > > | |
| infos | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | protected |
| init() | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | protected |
| maximize | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | protected |
| maxMsgDim | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | private |
| measureProbOfOpt | frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > > | private |
| method | frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > > | protected |
| minNCCCs | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | private |
| myID | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | protected |
| newClusterInfo() | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | protected |
| notifyIn(Message msg) | frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > > | |
| frodo2::algorithms::StatsReporter.notifyIn(Message msg, Object toAgent) | frodo2.communication.IncomingMsgPolicyInterface< T > | |
| one | frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > > | private |
| OPT_UTIL_MSG_TYPE | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | static |
| optUtil | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | protected |
| OUTPUT_MSG_TYPE | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | static |
| parseMethod(Element parameters) | frodo2.algorithms.dpop.stochastic.robust.WorstCaseUTIL< Val extends Addable< Val >, U extends Addable< U > > | protected |
| problem | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | protected |
| probOfOptimality | frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > > | private |
| project(UtilitySolutionSpace< Val, U > space, String[] vars) | frodo2.algorithms.dpop.stochastic.robust.WorstCaseUTIL< Val extends Addable< Val >, U extends Addable< U > > | protected |
| projectAndSend(ClusterInfo info) | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | protected |
| queue | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | protected |
| RAND_VARS_PROJ_MSG_TYPE | frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > > | static |
| randVarsProj | frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > > | protected |
| record(String senderVar, UtilitySolutionSpace< Val, U > space, ClusterInfo info) | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | protected |
| remainingVars | frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > > | private |
| reportStats | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | protected |
| reset() | frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > > | |
| sendOutput(UtilitySolutionSpace< Val, U > space, String root) | frodo2.algorithms.dpop.stochastic.robust.WorstCaseUTIL< Val extends Addable< Val >, U extends Addable< U > > | protected |
| sendSeparator(String sender, String senderAgent, String dest, String[] separator) | frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > > | protected |
| sendToParent(String var, String parentVar, String parentAgent, UtilitySolutionSpace< Val, U > space) | frodo2.algorithms.dpop.stochastic.robust.WorstCaseUTIL< Val extends Addable< Val >, U extends Addable< U > > | protected |
| SEPARATOR_MSG_TYPE | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | static |
| setQueue(Queue queue) | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | |
| setSilent(boolean silent) | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | |
| sliceSpaces(ClusterInfo varInfo) | frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > > | private |
| solution | frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > > | private |
| START_MSG_TYPE | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | static |
| started | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | protected |
| UTIL_MSG_TYPE | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | static |
| UTIL_STATS_MSG_TYPE | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | static |
| UTILpropagation() | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | |
| UTILpropagation(DCOPProblemInterface< Val, U > problem) | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | |
| UTILpropagation(DCOPProblemInterface< Val, U > problem, Element parameters) | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | |
| UTILpropagation(Element parameters, DCOPProblemInterface< Val, U > problem) | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | |
| withAnonymVars | frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | protected |
| WorstCaseUTIL(Element parameters, DCOPProblemInterface< Val, U > problem) | frodo2.algorithms.dpop.stochastic.robust.WorstCaseUTIL< Val extends Addable< Val >, U extends Addable< U > > | |
| WorstCaseUTIL(DCOPProblemInterface< Val, U > problem, Element parameters) | frodo2.algorithms.dpop.stochastic.robust.WorstCaseUTIL< Val extends Addable< Val >, U extends Addable< U > > | |
| worstUtil | frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > > | private |
| zero | frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > > | private |
1.15.0