FRODO
Version 2.19.1
An open-source framework for Distributed Constraint Optimization (DCOP)
Loading...
Searching...
No Matches
Here is a list of all functions with links to the classes they belong to:
- f -
f() :
frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >
FactorGraphGen() :
frodo2.algorithms.varOrdering.factorgraph.FactorGraphGen< V extends Addable< V >, U extends Addable< U > >
factorGraphToDOT() :
frodo2.algorithms.varOrdering.factorgraph.FactorGraphGen< V extends Addable< V >, U extends Addable< U > >
FakeCryptoScheme() :
frodo2.algorithms.dpop.privacy.test.FakeCryptoScheme
FakeCryptoSchemeTest() :
frodo2.algorithms.dpop.privacy.test.FakeCryptoSchemeTest
fakeEncrypt() :
frodo2.algorithms.mpc_discsp.PaillierPublicKey
FakeEncryptedInteger() :
frodo2.algorithms.dpop.privacy.test.FakeCryptoScheme.FakeEncryptedInteger
FakeQueue() :
frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >.FakeQueue
,
frodo2.communication.mailer.CentralMailer.FakeQueue
fakeSerialize() :
frodo2.algorithms.adopt.BoundsMsg< Val extends Addable< Val >, U extends Addable< U > >
,
frodo2.algorithms.adopt.HeuristicMsg< Val extends Addable< Val >, U extends Addable< U > >
,
frodo2.algorithms.dpop.count.CountSolutionsUTIL< Val extends Addable< Val >, U extends Addable< U > >.SolutionMessage< Val extends Addable< Val >, U extends Addable< U > >
,
frodo2.algorithms.dpop.param.ParamUTIL< Val extends Addable< Val >, U extends Addable< U > >.OptUtilMessage< Val extends Addable< Val >, U extends Addable< U > >
,
frodo2.algorithms.dpop.param.ParamVALUE< Val extends Addable< Val > >.AssignmentMessage< Val extends Addable< Val > >
,
frodo2.algorithms.dpop.param.VALUEmsg< Val extends Addable< Val > >
,
frodo2.algorithms.dpop.privacy.EncrUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E >
,
frodo2.algorithms.dpop.UTILmsg< Val extends Addable< Val >, U extends Addable< U > >
,
frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >.SolutionMessage< Val extends Addable< Val > >
,
frodo2.algorithms.maxsum.FunctionMsg< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.maxsum.VariableMsg< V extends Addable< V >, U extends Addable< U > >
,
frodo2.communication.Message
FbCpaMsg() :
frodo2.algorithms.afb.FbCpaMsg< V extends Addable< V >, U extends Addable< U > >
FbEstimateMsg() :
frodo2.algorithms.afb.FbEstimateMsg< V extends Addable< V >, U extends Addable< U > >
fillOwnOptions() :
frodo2.algorithms.asodpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > >
fillTree() :
frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
,
frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
fillVariablesValues() :
frodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable >
filter() :
org.jacop.constraints.AndBoolCloneable
finalDomainSizeReceiver() :
frodo2.algorithms.asodpop.goodsTree.innerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U > >
,
frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
finalize() :
frodo2.communication.MessageWithRawData
,
frodo2.communication.tcp.RawDataHandlerTCP
,
frodo2.solutionSpaces.JaCoP.JaCoPutilSpaceIter2< V extends Addable< V > >
findAllSolutions() :
frodo2.algorithms.mpc_discsp.MPC_DisWCSP4< V extends Addable< V > >
findFirstSolution() :
frodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >
,
frodo2.algorithms.mpc_discsp.MPC_DisWCSP4< V extends Addable< V > >
findMaxConstraintArity() :
frodo2.benchmarks.auctions.xcsp.Instance
findMaxUB() :
frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
findMaxUtility() :
frodo2.benchmarks.auctions.main.CATSToXCSP
findOptimalAssignmentAndSend() :
frodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >
findOptimalValueForIsolatedVar() :
frodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E >
findOrCloneInto() :
org.jacop.core.StoreCloneable
findUnused() :
frodo2.algorithms.asodpop.goodsTree.innerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U > >
,
frodo2.algorithms.asodpop.goodsTree.innerNodeTreeBinaryDomains.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U > >
,
frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
finished() :
frodo2.algorithms.SingleQueueAgent< Val extends Addable< Val > >
finishedSampling() :
frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo
flip() :
org.jacop.constraints.netflow.ArithmeticCloneable
flipSign() :
frodo2.solutionSpaces.Addable< T extends Addable< T > >
,
frodo2.solutionSpaces.AddableBigDecimal
,
frodo2.solutionSpaces.AddableBigDecimal.MinInfinity
,
frodo2.solutionSpaces.AddableBigDecimal.PlusInfinity
,
frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >
,
frodo2.solutionSpaces.AddableInteger
,
frodo2.solutionSpaces.AddableInteger.MinInfinity
,
frodo2.solutionSpaces.AddableInteger.PlusInfinity
,
frodo2.solutionSpaces.AddableReal
,
frodo2.solutionSpaces.AddableReal.MinInfinity
,
frodo2.solutionSpaces.AddableReal.PlusInfinity
,
frodo2.solutionSpaces.crypto.AddableBigInteger
,
frodo2.solutionSpaces.crypto.AddableBigInteger.MinInfinity
,
frodo2.solutionSpaces.crypto.AddableBigInteger.PlusInfinity
Forwarder() :
frodo2.algorithms.dpop.privacy.test.SecureCircularRoutingTest.Forwarder
foundUndefinedRelations() :
frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >
,
frodo2.benchmarks.vehiclerouting.XCSPparserVRP< U extends Addable< U > >
,
frodo2.solutionSpaces.JaCoP.JaCoPxcspParser< V extends Addable< V > >
freezeTime() :
frodo2.communication.mailer.CentralMailer.FakeQueue
fromBooleanArrayToInt() :
frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.LeafNode< U extends Addable< U > >
fromInt() :
frodo2.solutionSpaces.Addable< T extends Addable< T > >
,
frodo2.solutionSpaces.AddableBigDecimal
,
frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >
,
frodo2.solutionSpaces.AddableInteger
,
frodo2.solutionSpaces.AddableReal
,
frodo2.solutionSpaces.crypto.AddableBigInteger
fromString() :
frodo2.solutionSpaces.Addable< T extends Addable< T > >
,
frodo2.solutionSpaces.AddableBigDecimal
,
frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >
,
frodo2.solutionSpaces.AddableInteger
,
frodo2.solutionSpaces.AddableReal
,
frodo2.solutionSpaces.crypto.AddableBigInteger
fromXML() :
frodo2.communication.MessageType
FSMCloneable() :
org.jacop.util.fsm.FSMCloneable
FunctionInfo() :
frodo2.algorithms.maxsum.MaxSum< V extends Addable< V >, U extends Addable< U > >.FunctionInfo
FunctionMsg() :
frodo2.algorithms.maxsum.FunctionMsg< V extends Addable< V >, U extends Addable< U > >
FunctionNode() :
frodo2.algorithms.varOrdering.factorgraph.FunctionNode< V extends Addable< V >, U extends Addable< U > >
Generated on
for FRODO by
1.15.0