FRODO
Version 2.19.1
An open-source framework for Distributed Constraint Optimization (DCOP)
Loading...
Searching...
No Matches
Here is a list of all class members with links to the classes they belong to:
- d -
d :
frodo2.daemon.TestLocalWhitePages
DAEMON :
frodo2.daemon.Daemon
Daemon() :
frodo2.daemon.Daemon
daemon :
frodo2.controller.TestController
,
frodo2.daemon.Constructor
,
frodo2.daemon.LocalConfigManager
,
frodo2.daemon.LocalWhitePages
,
frodo2.daemon.userIO.UserIO
daemonAddress :
frodo2.daemon.Daemon
daemonCount :
frodo2.controller.WhitePages
DaemonExtension() :
frodo2.controller.TestController.DaemonExtension
daemonId :
frodo2.daemon.Daemon
daemonList :
frodo2.controller.ConfigurationManager
daemonListener :
frodo2.controller.TestConfigurationManager
daemonNb :
frodo2.controller.Controller
daemonQueue :
frodo2.daemon.Daemon
daemons :
frodo2.controller.WhitePages
data :
frodo2.communication.MessageSerializedSimple< T extends Serializable >
data_lock :
frodo2.communication.MessageSerializedSimple< T extends Serializable >
DEAMON_LIST_REQUEST :
frodo2.controller.userIO.UserIO
DEAMON_REPORTING :
frodo2.controller.messages.MessageAgentReporting
DEAMONS_CONFIG_MSG :
frodo2.controller.WhitePages
DEAMONS_LIST :
frodo2.controller.WhitePages
DEBUG :
frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >
debug :
frodo2.controller.ConfigurationManager
,
frodo2.solutionSpaces.crypto.ElGamalScheme
,
frodo2.solutionSpaces.JaCoP.Predicate
decider :
frodo2.communication.QueueTest
decideSingleton() :
frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >
decisionStrategy :
frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >
declaredOrder :
frodo2.algorithms.dpop.privacy.SecureRerooting< C extends Addable< C >, E extends AddableLimited< C, E >.VariableInfo
,
frodo2.algorithms.varOrdering.dfs.DFSgenerationWithOrder< V extends Addable< V >, 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 > >
decodeDomains :
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
decompositionConstraints :
frodo2.solutionSpaces.JaCoP.Predicate
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 >
default_numBits :
frodo2.algorithms.dpop.privacy.VariableObfuscation< V extends Addable< V >, U extends Addable< U > >
DEFAULT_P2 :
frodo2.algorithms.test.AllTests
DEFAULT_PORT :
frodo2.daemon.Daemon
DEFAULT_TIMEOUT :
frodo2.algorithms.AgentFactory< V extends Addable< V >, U extends Addable< U > >
defaultUtil :
frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >.Relation< V extends Addable< V >, U extends Addable< U > >
defaultUtility :
frodo2.benchmarks.auctions.xcsp.Relation
defaultValuation :
frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >
defaultViz :
frodo2.gui.Visualizer
deg :
frodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >
delayed :
frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.MyIter
,
frodo2.solutionSpaces.hypercube.ExpectationOutput< V extends Addable< V >, U extends Addable< U > >.MyIter
delayGenerator :
frodo2.communication.mailer.CentralMailer
deleteIncomingMessagePolicy() :
frodo2.communication.Queue
deleteOutgoingMessagePolicy() :
frodo2.communication.Queue
deleteStatsReporters() :
frodo2.communication.Queue
DELIVERY_MSG_TYPE :
frodo2.algorithms.dpop.privacy.SecureCircularRouting
DeliveryMsg() :
frodo2.algorithms.dpop.privacy.DeliveryMsg< M extends Message >
delta :
frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Serializable &Addable< U > >
,
frodo2.algorithms.duct.Sampling< V extends Addable< V > >
demand :
frodo2.benchmarks.vehiclerouting.CordeauToXCSP.Customer
,
frodo2.solutionSpaces.vehiclerouting.Customer
depots :
frodo2.benchmarks.vehiclerouting.CordeauToXCSP.Customer
,
frodo2.benchmarks.vehiclerouting.CordeauToXCSP
depotX :
frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >
depotY :
frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >
depthFinalVariable :
frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >
depthOfFirstToBeRemovedVariables :
frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >
depthToVariable :
frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >
description :
frodo2.solutionSpaces.JaCoP.Predicate
deserializeRawData() :
frodo2.communication.MessageSerializedSimple< T extends Serializable >
,
frodo2.communication.MessageWithRawData
dest :
frodo2.algorithms.afb.AFBBaseMsg< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare >.DecryptionOutput< C extends Addable< C > >
,
frodo2.algorithms.dpop.UTILmsg< Val extends Addable< Val >, U extends Addable< U > >
,
frodo2.algorithms.RandGraphFactory.Edge
,
frodo2.algorithms.synchbb.BTmsg
,
frodo2.algorithms.varOrdering.dfs.ReleaseDFSmsg
destinations :
frodo2.communication.MessageWrapper
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 > >
dfs :
frodo2.algorithms.adopt.test.testADOPT
,
frodo2.algorithms.adopt.test.testPreprocessing
,
frodo2.algorithms.adopt.test.testPreprocessing.receiveLowerBounds
,
frodo2.algorithms.asodpop.tests.ASODPOPBinaryTest< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.asodpop.tests.ASODPOPTest< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.dpop.privacy.SecureCircularRouting
,
frodo2.algorithms.dpop.privacy.test.SecureCircularRoutingTest
,
frodo2.algorithms.dpop.stochastic.test.LowestCommonAncestorsTest
,
frodo2.algorithms.dpop.test.UTILpropagationTest< U extends Addable< U > >
,
frodo2.algorithms.dpop.test.VALUEpropagationTest< U extends Addable< U > >
,
frodo2.algorithms.duct.tests.NormalizeInfTest
,
frodo2.algorithms.duct.tests.NormalizeTest
,
frodo2.algorithms.odpop.tests.UTILpropagationTest< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.odpop.tests.VALUEpropagationTest< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationTest
DFS_MSG_TYPE :
frodo2.algorithms.dpop.count.CountSolutionsUTIL< Val extends Addable< Val >, U extends Addable< U > >
,
frodo2.algorithms.dpop.count.CountSolutionsVALUE< Val extends Addable< Val >, U extends Addable< U > >
,
frodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.dpop.stochastic.LowestCommonAncestors
,
frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >
,
frodo2.algorithms.dpop.VALUEpropagation< Val extends Addable< Val > >
DFS_OUTPUT_MSG_TYPE :
frodo2.algorithms.dpop.privacy.SecureCircularRouting
DFS_WITH_ORDER_OUTPUT_MSG_TYPE :
frodo2.algorithms.dpop.privacy.SecureCircularRouting
DFSgeneration() :
frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >
dfsGenerationConstructor :
frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >
DFSgenerationParallel() :
frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >
DFSgenerationParallelTest() :
frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationParallelTest
dfsGenerationParams :
frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >
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
dfsHeuristic :
frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >
dfsModule :
frodo2.algorithms.adopt.ADOPTsolver< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.asodpop.ASODPOPsolver< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.dpop.DPOPsolver< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.duct.DUCTsolver< V extends Addable< V > >
,
frodo2.algorithms.odpop.ODPOPsolver< V extends Addable< V >, U extends Addable< U > >
dfsOrderMsgs :
frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >.FakeQueue
DFSorderOutputMessage() :
frodo2.algorithms.varOrdering.dfs.DFSgenerationWithOrder< V extends Addable< V >, U extends Addable< U > >.DFSorderOutputMessage
dfsOutputMsgs :
frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >.FakeQueue
dfsReceived :
frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >
dfsStatsMsgs :
frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >.FakeQueue
dfsString :
frodo2.algorithms.dpop.stochastic.E_DPOPsolver< V extends Addable< V >, U extends Addable< U > >
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 > >
dfsView :
frodo2.algorithms.dpop.memory.LabelingPhase< V extends Addable< V > >.VarInfo
dfsViews :
frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >
dictator :
frodo2.algorithms.varOrdering.linear.CentralLinearOrdering< V extends Addable< V >, U extends Addable< U > >
DIE :
frodo2.daemon.LocalWhitePages
Diff2Cloneable() :
org.jacop.constraints.Diff2Cloneable
DiffCloneable() :
org.jacop.constraints.DiffCloneable
DiffnCloneable() :
org.jacop.constraints.diffn.DiffnCloneable
DiffnDecomposedCloneable() :
org.jacop.constraints.diffn.DiffnDecomposedCloneable
DISCARD :
frodo2.communication.OutgoingMsgPolicyInterface< T >.Decision
discardRawData() :
frodo2.communication.MessageWithRawData.RawDataHandler
,
frodo2.communication.tcp.RawDataHandlerTCP
discsp :
frodo2.benchmarks.auctions.main.CATSToXCSP
DisjointCloneable() :
org.jacop.constraints.DisjointCloneable
DisjointConditionalCloneable() :
org.jacop.constraints.DisjointConditionalCloneable
displayLicense() :
frodo2.benchmarks.auctions.main.CATSToXCSP
displayMethods() :
frodo2.benchmarks.auctions.main.CATSToXCSP
displayTime :
frodo2.gui.Visualizer
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 >
distributions :
frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo
divide :
frodo2.algorithms.duct.Normalize< V extends Addable< V > >
,
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
doEdgeFind :
org.jacop.constraints.cumulative.CumulativeUnaryOptionalCloneable
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
dom :
frodo2.algorithms.varOrdering.factorgraph.VariableNode< V extends Addable< V >, U extends Addable< U > >
Domain() :
frodo2.benchmarks.auctions.xcsp.Domain
domain :
frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Serializable &Addable< U > >
,
frodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E >.VariableInfo
,
frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo
,
frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Addable< U > >
,
frodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >.ClusterInfo
,
frodo2.benchmarks.auctions.xcsp.Variable
DOMAIN_VALUE :
frodo2.algorithms.duct.VALUEmsg< V extends Addable< V > >
domainElementClass :
frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >
domainInfo :
frodo2.algorithms.asodpop.UTILdomMsg< Val extends Addable< Val >, U extends Addable< U > >
,
frodo2.algorithms.asodpop.UTILvarsMsgWithDom< Val extends Addable< Val >, U extends Addable< U > >
,
frodo2.algorithms.odpop.UTILdomMsg< Val extends Addable< Val >, U extends Addable< U > >
,
frodo2.algorithms.odpop.UTILvarsMsgWithDom< Val extends Addable< Val >, U extends Addable< U > >
Domains() :
frodo2.benchmarks.auctions.xcsp.Domains
domains :
frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >
,
frodo2.algorithms.adopt.test.testPreprocessing
,
frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >.ClusterInfo
,
frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >
,
frodo2.algorithms.asodpop.ASODPOPBinaryDomains< 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 > >
,
frodo2.algorithms.odpop.UTILvarsDomsMsg< Val extends Addable< Val >, U extends Addable< U > >
,
frodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >
,
frodo2.benchmarks.auctions.xcsp.Domains
,
frodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable >
,
frodo2.solutionSpaces.hypercube.BasicHypercubeIter< V extends Addable< V >, U extends Serializable >
,
frodo2.solutionSpaces.hypercube.ScalarBasicSpaceIter< V extends Addable< V >, U extends Serializable >
,
frodo2.solutionSpaces.JaCoP.JaCoPutilSpaceIter2< V extends Addable< V > >
,
frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >
,
frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.VRPiteratorBestFirst
domainSize :
frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo
,
frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Addable< U > >
,
frodo2.algorithms.localSearch.dsa.tests.TestDSA< U extends Addable< U > >
,
frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
,
frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > >
domClass :
frodo2.algorithms.adopt.test.ADOPTagentTest< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.asodpop.tests.ASODPOPagentTest< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.asodpop.tests.ASODPOPBinaryAgentTest< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.asodpop.tests.ASODPOPBinaryTest< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.asodpop.tests.ASODPOPTest< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.dpop.privacy.test.P2_DPOPagentTest< V extends Addable< V >, E extends AddableLimited< AddableInteger, E >
,
frodo2.algorithms.dpop.privacy.test.P_DPOPagentTest< V extends Addable< V > >
,
frodo2.algorithms.dpop.privacy.test.VariableObfuscationTest< V extends Addable< V > >
,
frodo2.algorithms.dpop.restart.test.TestSDPOP< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.dpop.test.DPOPagentTest< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.localSearch.dsa.tests.DSAagentTest< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.localSearch.mgm.mgm2.tests.MGM2agentTest< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.localSearch.mgm.tests.MGMagentTest< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.MASparser< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.odpop.tests.ODPOPagentTest< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.odpop.tests.ODPOPagentTestBinaryDomains< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.odpop.tests.ODPOPagentTestFullDomain< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.odpop.tests.UTILpropagationTest< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.odpop.tests.VALUEpropagationTest< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >
doms :
frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >
domSizes :
frodo2.algorithms.varOrdering.linear.CentralLinearOrdering< V extends Addable< V >, U extends Addable< U > >.MaxWidthMinDom< V extends Addable< V >, U extends Addable< U > >
DONE :
frodo2.algorithms.dpop.privacy.SecureRerooting< C extends Addable< C >, E extends AddableLimited< C, E >
,
frodo2.algorithms.reformulation.ProblemRescaler< U extends Addable< U > >
done :
frodo2.algorithms.AgentFactory< V extends Addable< V >, U extends Addable< U > >
,
frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo
,
frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo
,
frodo2.algorithms.odpop.UTILpropagationFullDomain< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.VariableInfo
,
frodo2.controller.userIO.Console
,
frodo2.daemon.userIO.Console
DONE_MSG :
frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >
,
frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >
,
frodo2.algorithms.odpop.UTILpropagationFullDomain< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
DONEmsg() :
frodo2.algorithms.odpop.DONEmsg
DoneMsg() :
frodo2.algorithms.dpop.privacy.DoneMsg
doneWriting :
frodo2.communication.MsgSizeMonitor
donorABO :
frodo2.benchmarks.kidneys.KidneyExchange.PatientDonorPair
DONTCARE :
frodo2.communication.OutgoingMsgPolicyInterface< T >.Decision
doProfile :
org.jacop.constraints.cumulative.CumulativeUnaryCloneable
,
org.jacop.constraints.cumulative.CumulativeUnaryOptionalCloneable
dotFileName :
frodo2.gui.DOTrenderer
dotImage :
frodo2.gui.DOTrenderer
DOTrenderer() :
frodo2.gui.DOTrenderer
dotRendererClass :
frodo2.algorithms.dpop.memory.LabelingPhase< V extends Addable< V > >
,
frodo2.algorithms.dpop.privacy.SecureCircularRouting
,
frodo2.algorithms.dpop.stochastic.CompleteUTIL< Val extends Addable< Val >, 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 > >
,
frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >
,
frodo2.gui.SimpleGUI
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 > >
DPOP :
frodo2.solutionSpaces.JaCoP.tests.JaCoPtests< V extends Addable< V > >.Algorithm
DPOPagent :
frodo2.algorithms.dpop.restart.test.TestSDPOP< V extends Addable< V >, U extends Addable< U > >
DPOPagentTest() :
frodo2.algorithms.dpop.test.DPOPagentTest< V extends Addable< V >, U extends Addable< U > >
dpopPath :
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 > >
,
frodo2.algorithms.dpop.restart.test.TestSDPOP< 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 > >
,
frodo2.solutionSpaces.JaCoP.tests.JaCoPtests< V extends Addable< V > >.Algorithm
DSAagentTest() :
frodo2.algorithms.localSearch.dsa.tests.DSAagentTest< V extends Addable< V >, U extends Addable< U > >
dsaModule :
frodo2.algorithms.localSearch.dsa.DSAsolver< 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 > >
dummy :
frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
dummyDepth :
frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
dummyFillPercentage :
frodo2.algorithms.odpop.ODPOPsolution< V, U >
,
frodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >.AssignmentMessage< Val extends Addable< Val >, U extends Addable< U > >
dummyGoodsToBiddersMap :
frodo2.benchmarks.auctions.main.CATSToXCSP
dummyPattern :
frodo2.benchmarks.auctions.main.CATSToXCSP
durations :
org.jacop.constraints.cumulative.CumulativeBasicCloneable
,
org.jacop.constraints.cumulative.CumulativeCloneable
,
org.jacop.constraints.cumulative.CumulativeOptionalCloneable
,
org.jacop.constraints.cumulative.CumulativePrimaryCloneable
,
org.jacop.constraints.cumulative.CumulativeUnaryCloneable
,
org.jacop.constraints.cumulative.CumulativeUnaryOptionalCloneable
Generated on
for FRODO by
1.15.0