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:
- d -
Daemon() :
frodo2.daemon.Daemon
DaemonExtension() :
frodo2.controller.TestController.DaemonExtension
decideSingleton() :
frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >
decode() :
frodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E >.VariableInfo
decodeCodeName() :
frodo2.algorithms.dpop.privacy.VariableObfuscation< V extends Addable< V >, U extends Addable< U > >
decodeDomain() :
frodo2.algorithms.dpop.privacy.VariableObfuscation< V extends Addable< V >, U extends Addable< U > >
decompose() :
frodo2.solutionSpaces.JaCoP.Predicate
,
org.jacop.constraints.diffn.DiffnDecomposedCloneable
,
org.jacop.constraints.netflow.ArithmeticCloneable
,
org.jacop.constraints.SequenceCloneable
,
org.jacop.constraints.SoftAlldifferentCloneable
,
org.jacop.constraints.SoftGCCCloneable
,
org.jacop.constraints.StretchCloneable
decomposeByRegular() :
org.jacop.constraints.SequenceCloneable
decomposeLE() :
org.jacop.constraints.LexCloneable
decomposeLERegular() :
org.jacop.constraints.LexCloneable
decomposeLT() :
org.jacop.constraints.LexCloneable
decomposeLTRegular() :
org.jacop.constraints.LexCloneable
DecreasingCloneable() :
org.jacop.constraints.DecreasingCloneable
decrypt() :
frodo2.algorithms.dpop.privacy.test.FakeCryptoScheme
,
frodo2.algorithms.dpop.privacy.test.FakeCryptoSchemeTest
,
frodo2.algorithms.mpc_discsp.PaillierCryptoScheme
,
frodo2.solutionSpaces.crypto.CryptoScheme< C extends Serializable, E extends Serializable, K extends CryptoScheme.PublicKeyShare >
,
frodo2.solutionSpaces.crypto.ElGamalScheme
,
frodo2.solutionSpaces.crypto.ElGamalSchemeTest
decryptFor() :
frodo2.algorithms.dpop.privacy.DecryptRequest< C extends Addable< C >, E extends AddableLimited< C, E >
decryptInfinity() :
frodo2.algorithms.dpop.privacy.test.FakeCryptoSchemeTest
DecryptionOutput() :
frodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare >.DecryptionOutput< C extends Addable< C > >
decryptMySelfUtility() :
frodo2.algorithms.dpop.privacy.VariableObfuscation< V extends Addable< V >, U extends Addable< U > >
decryptOnce() :
frodo2.solutionSpaces.crypto.ElGamalSchemeTest
DecryptRequest() :
frodo2.algorithms.dpop.privacy.DecryptRequest< C extends Addable< C >, E extends AddableLimited< C, E >
decryptUtility() :
frodo2.algorithms.dpop.privacy.VariableObfuscation< V extends Addable< V >, U extends Addable< U > >
DecryptVectorRequest() :
frodo2.algorithms.dpop.privacy.DecryptVectorRequest< C extends Addable< C >, E extends AddableLimited< C, E >
deleteIncomingMessagePolicy() :
frodo2.communication.Queue
deleteOutgoingMessagePolicy() :
frodo2.communication.Queue
deleteStatsReporters() :
frodo2.communication.Queue
DeliveryMsg() :
frodo2.algorithms.dpop.privacy.DeliveryMsg< M extends Message >
deserializeRawData() :
frodo2.communication.MessageSerializedSimple< T extends Serializable >
,
frodo2.communication.MessageWithRawData
dest() :
frodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare >.DecryptionOutput< C extends Addable< C > >
determineAssignment() :
frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.A< Val extends Addable< Val >, U extends Addable< U > >
,
frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.C< Val extends Addable< Val >, U extends Addable< U > >
,
frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.DetermineAssignment< Val extends Addable< Val >, U extends Addable< U > >
,
frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.E< Val extends Addable< Val >, U extends Addable< U > >
DetermineAssignmentMax() :
frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >.DetermineAssignmentMax< Val extends Addable< Val >, U extends Addable< U > >
,
frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >.DetermineAssignmentMax< Val extends Addable< Val >, U extends Addable< U > >
determinePossibleImprovement() :
frodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >
determineVariableValue() :
frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >.determineAssignment< Val extends Addable< Val >, U extends Addable< U > >
,
frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >.DetermineAssignmentMax< Val extends Addable< Val >, U extends Addable< U > >
,
frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >.determineAssignment< Val extends Addable< Val >, U extends Addable< U > >
,
frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >.DetermineAssignmentMax< Val extends Addable< Val >, U extends Addable< U > >
DFSgeneration() :
frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >
DFSgenerationParallel() :
frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >
DFSgenerationParallelTest() :
frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationParallelTest
DFSgenerationTest() :
frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationTest
DFSgenerationWithOrder() :
frodo2.algorithms.varOrdering.dfs.DFSgenerationWithOrder< V extends Addable< V >, U extends Addable< U > >
DFSgenerationWithOrderTest() :
frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationWithOrderTest
DFSorderOutputMessage() :
frodo2.algorithms.varOrdering.dfs.DFSgenerationWithOrder< V extends Addable< V >, U extends Addable< U > >.DFSorderOutputMessage
dfsToString() :
frodo2.algorithms.dpop.stochastic.CompleteUTIL< Val extends Addable< Val >, U extends Addable< U > >
,
frodo2.algorithms.dpop.stochastic.E_DPOPsolver< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >
DFSview() :
frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSview< V extends Addable< V >, U extends Addable< U > >
Diff2Cloneable() :
org.jacop.constraints.Diff2Cloneable
DiffCloneable() :
org.jacop.constraints.DiffCloneable
DiffnCloneable() :
org.jacop.constraints.diffn.DiffnCloneable
DiffnDecomposedCloneable() :
org.jacop.constraints.diffn.DiffnDecomposedCloneable
discardRawData() :
frodo2.communication.MessageWithRawData.RawDataHandler
,
frodo2.communication.tcp.RawDataHandlerTCP
DisjointCloneable() :
org.jacop.constraints.DisjointCloneable
DisjointConditionalCloneable() :
org.jacop.constraints.DisjointConditionalCloneable
displayLicense() :
frodo2.benchmarks.auctions.main.CATSToXCSP
displayMethods() :
frodo2.benchmarks.auctions.main.CATSToXCSP
DistanceCloneable() :
org.jacop.constraints.DistanceCloneable
distributeAgents() :
frodo2.controller.ConfigurationManager
,
frodo2.daemon.LocalConfigManager
DistributedSolver() :
frodo2.controller.userIO.DistributedSolver< V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >
divide() :
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
doIrespond() :
frodo2.algorithms.maxsum.MaxSum< V extends Addable< V >, U extends Addable< U > >.FunctionInfo
,
frodo2.algorithms.maxsum.MaxSum< V extends Addable< V >, U extends Addable< U > >.VarInfo
Domain() :
frodo2.benchmarks.auctions.xcsp.Domain
Domains() :
frodo2.benchmarks.auctions.xcsp.Domains
DONEmsg() :
frodo2.algorithms.odpop.DONEmsg
DoneMsg() :
frodo2.algorithms.dpop.privacy.DoneMsg
DOTrenderer() :
frodo2.gui.DOTrenderer
doubleValue() :
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.AddableReal
,
frodo2.solutionSpaces.crypto.AddableBigInteger
,
frodo2.solutionSpaces.crypto.AddableBigInteger.MinInfinity
,
frodo2.solutionSpaces.crypto.AddableBigInteger.PlusInfinity
,
frodo2.solutionSpaces.vehiclerouting.Customer
downSample() :
frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLCAs< V extends Addable< V >, U extends Addable< U > >
DP0() :
frodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.DP0< Val extends Addable< Val >, U extends Addable< U > >
DP1() :
frodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.DP1< Val extends Addable< Val >, U extends Addable< U > >
DP2() :
frodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.DP2< Val extends Addable< Val >, U extends Addable< U > >
DPOPagentTest() :
frodo2.algorithms.dpop.test.DPOPagentTest< V extends Addable< V >, U extends Addable< U > >
DPOPsolver() :
frodo2.algorithms.dpop.DPOPsolver< V extends Addable< V >, U extends Addable< U > >
drawEdges() :
frodo2.gui.jung.JungVisualizer
drawVertices() :
frodo2.gui.jung.JungVisualizer
DSA() :
frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >
DSAagentTest() :
frodo2.algorithms.localSearch.dsa.tests.DSAagentTest< V extends Addable< V >, U extends Addable< U > >
DSAsolver() :
frodo2.algorithms.localSearch.dsa.DSAsolver< V extends Addable< V >, U extends Addable< U > >
DUCTagentChildSearchTest() :
frodo2.algorithms.duct.tests.DUCTagentChildSearchTest
DUCTagentChildTest() :
frodo2.algorithms.duct.tests.DUCTagentChildTest
DUCTagentPruningSearchTest() :
frodo2.algorithms.duct.tests.DUCTagentPruningSearchTest
DUCTagentPruningTest() :
frodo2.algorithms.duct.tests.DUCTagentPruningTest
DUCTagentTest() :
frodo2.algorithms.duct.tests.DUCTagentTest
DUCTSolution() :
frodo2.algorithms.duct.DUCTSolution< V extends Addable< V > >
DUCTsolver() :
frodo2.algorithms.duct.DUCTsolver< V extends Addable< V > >
Generated on
for FRODO by
1.15.0