Packages

class AnytimeLSVE extends LazyStructuredVE with AnytimeLazyStructuredProbQuery

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. AnytimeLSVE
  2. AnytimeLazyStructuredProbQuery
  3. AnytimeBoundsProbQuery
  4. AnytimeStructuredProbQuery
  5. AnytimeProbQuery
  6. AnytimeLazyStructured
  7. AnytimeStructured
  8. Anytime
  9. LazyStructuredVE
  10. LazyStructuredProbQueryAlgorithm
  11. BoundsProbQueryAlgorithm
  12. LazyStructured
  13. StructuredProbQueryAlgorithm
  14. ProbQueryAlgorithm
  15. BaseProbQueryAlgorithm
  16. StructuredAlgorithm
  17. Algorithm
  18. AnyRef
  19. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new AnytimeLSVE(depthIncrement: Int, universe: Universe, targets: Element[_]*)

Type Members

  1. class Runner extends Actor

    A class representing the actor running the algorithm.

    A class representing the actor running the algorithm.

    Definition Classes
    Anytime
  2. case class AllProbabilityBounds [T](bounds: Stream[(Double, Double, T)]) extends Response with Product with Serializable

    A message from the handler containing all probability bounds of the previously requested element.

    A message from the handler containing all probability bounds of the previously requested element.

    Definition Classes
    AnytimeBoundsProbQuery
  3. case class ComputeAllProbabilityBounds [T](target: Element[T]) extends Service with Product with Serializable

    A message instructing the handler to compute all probability bounds of the target element.

    A message instructing the handler to compute all probability bounds of the target element.

    Definition Classes
    AnytimeBoundsProbQuery
  4. case class ComputeExpectationBounds [T](target: Element[T], function: (T) ⇒ Double, bounds: Option[(Double, Double)]) extends Service with Product with Serializable

    A message instructing the handler to compute bounds on the expectation of the target element under the given function.

    A message instructing the handler to compute bounds on the expectation of the target element under the given function.

    Definition Classes
    AnytimeBoundsProbQuery
  5. case class ComputeProbabilityBounds [T](target: Element[T], predicate: (T) ⇒ Boolean) extends Service with Product with Serializable

    A message instructing the handler to compute bounds on the probability of the predicate for the target element.

    A message instructing the handler to compute bounds on the probability of the predicate for the target element.

    Definition Classes
    AnytimeBoundsProbQuery
  6. case class ExpectationBounds [T](bounds: (Double, Double)) extends Response with Product with Serializable

    A message from the handler containing the bounds on the expectation of the previously requested element and function.

    A message from the handler containing the bounds on the expectation of the previously requested element and function.

    Definition Classes
    AnytimeBoundsProbQuery
  7. case class ProbabilityBounds [T](bounds: (Double, Double)) extends Response with Product with Serializable

    A message from the handler containing the bounds on the probability of the previously requested element and predicate.

    A message from the handler containing the bounds on the probability of the previously requested element and predicate.

    Definition Classes
    AnytimeBoundsProbQuery
  8. case class ComputeDistribution [T](target: Element[T]) extends Service with Product with Serializable

    A message instructing the handler to compute the distribution of the target element.

    A message instructing the handler to compute the distribution of the target element.

    Definition Classes
    AnytimeProbQuery
  9. case class ComputeExpectation [T](target: Element[T], function: (T) ⇒ Double) extends Service with Product with Serializable

    A message instructing the handler to compute the expectation of the target element under the given function.

    A message instructing the handler to compute the expectation of the target element under the given function.

    Definition Classes
    AnytimeProbQuery
  10. case class ComputeProbability [T](target: Element[T], predicate: (T) ⇒ Boolean) extends Service with Product with Serializable

    A message instructing the handler to compute the probability of the predicate for the target element.

    A message instructing the handler to compute the probability of the predicate for the target element.

    Definition Classes
    AnytimeProbQuery
  11. case class ComputeProjection [T](target: Element[T]) extends Service with Product with Serializable

    A message instructing the handler to compute the projection of the target element.

    A message instructing the handler to compute the projection of the target element.

    Definition Classes
    AnytimeProbQuery
  12. case class Distribution [T](distribution: Stream[(Double, T)]) extends Response with Product with Serializable

    A message from the handler containing the distribution of the previously requested element.

    A message from the handler containing the distribution of the previously requested element.

    Definition Classes
    AnytimeProbQuery
  13. case class Expectation (expectation: Double) extends Response with Product with Serializable

    A message from the handler containing the expected value of the previously requested element and function.

    A message from the handler containing the expected value of the previously requested element and function.

    Definition Classes
    AnytimeProbQuery
  14. case class Probability (probability: Double) extends Response with Product with Serializable

    A message from the handler containing the probability of the previously requested predicate and element.

    A message from the handler containing the probability of the previously requested predicate and element.

    Definition Classes
    AnytimeProbQuery
  15. case class Projection [T](projection: List[(T, Double)]) extends Response with Product with Serializable

    A message from the handler containing the projection of the previously requested element.

    A message from the handler containing the projection of the previously requested element.

    Definition Classes
    AnytimeProbQuery
  16. class NotATargetException [T] extends AlgorithmException
    Definition Classes
    BaseProbQueryAlgorithm

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. val active: Boolean
    Attributes
    protected
    Definition Classes
    Algorithm
  5. def allProbabilityBounds[T](target: Element[T]): Stream[(Double, Double, T)]

    Return an estimate of the marginal probability distribution over the target that lists each value with its probability bounds.

    Return an estimate of the marginal probability distribution over the target that lists each value with its probability bounds. Each entry is a triple (lower, upper, value). The result is a lazy stream. It is up to the algorithm how the stream is ordered.

    target

    Element for which to compute bounds.

    returns

    Bounds on the probability of each value for this element.

    Definition Classes
    BoundsProbQueryAlgorithm
    Exceptions thrown

    AlgorithmInactiveException if the algorithm is inactive.

    NotATargetException if called on a target that is not in the list of targets of the algorithm.

  6. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  7. def awaitResponse(response: Future[Any], duration: Duration): Response
    Attributes
    protected
    Definition Classes
    Anytime
  8. def boundFactors[T](target: Element[T]): (Factor[Double], Factor[Double])

    Get the marginalized lower/upper factors for a particular target.

    Get the marginalized lower/upper factors for a particular target. This method is intended to be called once per inference query, and avoids concurrency issues. It guarantees that the factors returned are consistent and from a single solving run. Returns a pair containing, respectively, the marginalized factor computed using lower constraint bounds, and the marginalized factor computed using upper constraint bounds.

    Attributes
    protected
    Definition Classes
    LazyStructuredProbQueryAlgorithm
  9. def boundValues(values: Set[Double], bounds: Option[(Double, Double)]): (Double, Double)

    Helper function to compute lower and upper bounds on the given values using the optional bounds given and the double values of a target variable.

    Helper function to compute lower and upper bounds on the given values using the optional bounds given and the double values of a target variable. If bounds are given, it checks that all regular values are within the desired bounds. Otherwise, it returns the strongest possible bounds given the current values. If there are no values, it returns (-Infinity, Infinity).

    Attributes
    protected
    Definition Classes
    LazyStructuredProbQueryAlgorithm
  10. def check[T](target: Element[T]): Unit
    Attributes
    protected
    Definition Classes
    BaseProbQueryAlgorithm
  11. def checkConstraintBounds(): Unit

    Verify that all constraint factors satisfy the bounds needed for the correctness of this algorithm.

    Verify that all constraint factors satisfy the bounds needed for the correctness of this algorithm. This gets executed before solving. By default, this method does nothing; subclasses can override this to throw an exception if the bounds requirements are not met.

    Definition Classes
    LazyStructuredStructuredAlgorithm
  12. def cleanUp(): Unit

    Called when the algorithm is killed.

    Called when the algorithm is killed. By default, does nothing. Can be overridden.

    Definition Classes
    Algorithm
  13. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  14. val collection: ComponentCollection
    Definition Classes
    StructuredAlgorithm
  15. def computeAllProbabilityBounds[T](target: Element[T]): Stream[(Double, Double, T)]

    Return an estimate of the marginal probability distribution over the target that lists each value with its probability bounds.

    Return an estimate of the marginal probability distribution over the target that lists each value with its probability bounds. Each entry is a triple (lower, upper, value). The result is a lazy stream. It is up to the algorithm how the stream is ordered.

    Definition Classes
    LazyStructuredProbQueryAlgorithmBoundsProbQueryAlgorithm
  16. def computeDistribution[T](target: Element[T]): Stream[(Double, T)]

    Computes the normalized distribution over a single target element.

    Computes the normalized distribution over a single target element. Throws an IllegalArgumentException if the range of the target contains star, or if lower and upper bounds are needed.

    Definition Classes
    StructuredProbQueryAlgorithmBaseProbQueryAlgorithm
  17. def computeExpectation[T](target: Element[T], function: (T) ⇒ Double): Double

    Computes the expectation of a given function for single target element.

    Computes the expectation of a given function for single target element. Throws an IllegalArgumentException if the range of the target contains star, or if lower and upper bounds are needed.

    Definition Classes
    StructuredProbQueryAlgorithmBaseProbQueryAlgorithm
  18. def computeExpectationBounds[T](target: Element[T], function: (T) ⇒ Double, bounds: Option[(Double, Double)]): (Double, Double)

    Return an estimate of the bounds on the expectation of the function under the marginal probability distribution of the target.

    Return an estimate of the bounds on the expectation of the function under the marginal probability distribution of the target. The function is assumed to be bounded between the specified lower and upper bounds, if provided. Otherwise, the lower and upper bounds of the function using the current known values of the target are used.

    Definition Classes
    LazyStructuredProbQueryAlgorithmBoundsProbQueryAlgorithm
  19. def computeProbability[T](target: Element[T], predicate: (T) ⇒ Boolean): Double

    Return an estimate of the probability of the predicate under the marginal probability distribution of the target.

    Return an estimate of the probability of the predicate under the marginal probability distribution of the target.

    Definition Classes
    BaseProbQueryAlgorithm
  20. def computeProbabilityBounds[T](target: Element[T], predicate: (T) ⇒ Boolean): (Double, Double)

    Return an estimate of the probability of the bounds on the predicate under the marginal probability distribution of the target.

    Return an estimate of the probability of the bounds on the predicate under the marginal probability distribution of the target.

    Definition Classes
    BoundsProbQueryAlgorithm
  21. def computeProjection[T](target: Element[T]): List[(T, Double)]
    Attributes
    protected[com.cra.figaro.algorithm]
    Definition Classes
    BaseProbQueryAlgorithm
  22. var currentDepth: Int
  23. val customConf: Config

    The actor running the algorithm.

    The actor running the algorithm.

    Definition Classes
    Anytime
  24. def depth(): Int

    Depth to which to expand the model at the current iteration.

    Depth to which to expand the model at the current iteration.

    Definition Classes
    AnytimeLSVELazyStructuredVE
  25. def distribution(target: List[Element[_]]): (List[(String, ProblemComponent[_])], List[(Double, List[Extended[_]])])
    Definition Classes
    StructuredProbQueryAlgorithm
  26. def distribution[T](target: Element[T]): Stream[(Double, T)]

    Return an estimate of the marginal probability distribution over the target that lists each element with its probability.

    Return an estimate of the marginal probability distribution over the target that lists each element with its probability. The result is a lazy stream. It is up to the algorithm how the stream is ordered. Throws NotATargetException if called on a target that is not in the list of targets of the algorithm. Throws AlgorithmInactiveException if the algorithm is inactive.

    Definition Classes
    BaseProbQueryAlgorithm
  27. def doAllProbabilityBounds[T](target: Element[T]): Stream[(Double, Double, T)]
    Attributes
    protected
    Definition Classes
    AnytimeBoundsProbQueryBoundsProbQueryAlgorithm
  28. def doDistribution[T](target: Element[T]): Stream[(Double, T)]
    Attributes
    protected
    Definition Classes
    AnytimeProbQueryBaseProbQueryAlgorithm
  29. def doExpectation[T](target: Element[T], function: (T) ⇒ Double): Double
    Attributes
    protected
    Definition Classes
    AnytimeProbQueryBaseProbQueryAlgorithm
  30. def doExpectationBounds[T](target: Element[T], function: (T) ⇒ Double, bounds: Option[(Double, Double)]): (Double, Double)
    Attributes
    protected
    Definition Classes
    AnytimeBoundsProbQueryBoundsProbQueryAlgorithm
  31. def doKill(): Unit
    Attributes
    protected[com.cra.figaro.algorithm]
    Definition Classes
    AnytimeAlgorithm
  32. def doProbability[T](target: Element[T], predicate: (T) ⇒ Boolean): Double
    Attributes
    protected
    Definition Classes
    AnytimeProbQueryBaseProbQueryAlgorithm
  33. def doProbabilityBounds[T](target: Element[T], predicate: (T) ⇒ Boolean): (Double, Double)
    Attributes
    protected
    Definition Classes
    AnytimeBoundsProbQueryBoundsProbQueryAlgorithm
  34. def doProjection[T](target: Element[T]): List[(T, Double)]
    Attributes
    protected
    Definition Classes
    AnytimeProbQueryBaseProbQueryAlgorithm
  35. def doResume(): Unit
    Attributes
    protected[com.cra.figaro.algorithm]
    Definition Classes
    AnytimeAlgorithm
  36. def doStart(): Unit
    Attributes
    protected[com.cra.figaro.algorithm]
    Definition Classes
    AnytimeAlgorithm
  37. def doStop(): Unit
    Attributes
    protected[com.cra.figaro.algorithm]
    Definition Classes
    AnytimeAlgorithm
  38. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  39. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  40. def expectation[T](target: Element[T])(function: (T) ⇒ Double, c: Any = DummyImplicit): Double

    Return an estimate of the expectation of the function under the marginal probability distribution of the target.

    Return an estimate of the expectation of the function under the marginal probability distribution of the target. Throws NotATargetException if called on a target that is not in the list of targets of the algorithm. Throws AlgorithmInactiveException if the algorithm is inactive.

    Definition Classes
    BaseProbQueryAlgorithm
  41. def expectation[T](target: Element[T], function: (T) ⇒ Double): Double

    Return an estimate of the expectation of the function under the marginal probability distribution of the target.

    Return an estimate of the expectation of the function under the marginal probability distribution of the target. Throws NotATargetException if called on a target that is not in the list of targets of the algorithm. Throws AlgorithmInactiveException if the algorithm is inactive.

    Definition Classes
    BaseProbQueryAlgorithm
  42. def expectationBounds[T](target: Element[T], function: (T) ⇒ Double): (Double, Double)

    Return an estimate of the bounds on the expectation of the function under the marginal probability distribution of the target.

    Return an estimate of the bounds on the expectation of the function under the marginal probability distribution of the target. The function is assumed to be bounded according to the currently known values of the target. Thus, one should generally only use this when the range of the target is finite and known beforehand. Otherwise, one can use the overloaded version of this method that specifies explicit bounds on the function.

    target

    Element for which to compute bounds.

    function

    Function whose expectation is computed.

    returns

    Bounds on the expectation of this function for this element.

    Definition Classes
    BoundsProbQueryAlgorithm
    Exceptions thrown

    AlgorithmInactiveException if the algorithm is inactive.

    NotATargetException if called on a target that is not in the list of targets of the algorithm.

  43. def expectationBounds[T](target: Element[T], function: (T) ⇒ Double, lower: Double, upper: Double): (Double, Double)

    Return an estimate of the bounds on the expectation of the function under the marginal probability distribution of the target.

    Return an estimate of the bounds on the expectation of the function under the marginal probability distribution of the target. The function is assumed to be bounded between the specified lower and upper bounds.

    target

    Element for which to compute bounds.

    function

    Function whose expectation is computed.

    lower

    Lower bound on the function.

    upper

    Upper bound on the function.

    returns

    Bounds on the expectation of this function for this element.

    Definition Classes
    BoundsProbQueryAlgorithm
    Exceptions thrown

    AlgorithmInactiveException if the algorithm is inactive.

    IllegalArgumentException if the bounds given on the function are tighter than the actual bounds on the function, using the current known values of the target.

    NotATargetException if called on a target that is not in the list of targets of the algorithm.

  44. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  45. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  46. def handle(service: Service): Response

    A handler of services provided by the algorithm.

    A handler of services provided by the algorithm.

    Definition Classes
    AnytimeBoundsProbQueryAnytimeProbQueryAnytime
  47. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  48. val initialElements: List[Element[_]]

    Initial elements to pass to the bottom-up strategy for decomposition.

    Initial elements to pass to the bottom-up strategy for decomposition. Defaults to a list containing all problem targets and all evidence elements in the universe.

    Definition Classes
    LazyStructuredVE
  49. def initialize(): Unit

    Initialize the problem by adding all permanent elements to it.

    Initialize the problem by adding all permanent elements to it. This is to ensure that all top-level elements are correctly added to the top-level problem.

    Definition Classes
    LazyStructuredVEStructuredAlgorithmAlgorithm
  50. def isActive: Boolean
    Definition Classes
    Algorithm
  51. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  52. def kill(): Unit

    Kill the algorithm so that it is inactive.

    Kill the algorithm so that it is inactive. It will no longer be able to provide answers.Throws AlgorithmInactiveException if the algorithm is not active.

    Definition Classes
    Algorithm
  53. def mean(target: Element[Double]): Double

    Return the mean of the probability density function for the given continuous element.

    Return the mean of the probability density function for the given continuous element.

    Definition Classes
    BaseProbQueryAlgorithm
  54. implicit val messageTimeout: Timeout

    default message timeout.

    default message timeout. Increase if queries to the algorithm fail due to timeout

    Definition Classes
    Anytime
  55. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  56. def neededBounds(): Set[Bounds]

    All bounds for which this algorithm needs to compute solutions.

    All bounds for which this algorithm needs to compute solutions. This is determined by looking for components that have * in their range, and have constraint factors associated with them. If such a component exists, we need both lower and upper bounds. Otherwise, just one of the bounds suffices because they are equivalent; it defaults to lower in this case.

    returns

    All bounds for which this algorithm should compute solutions.

    Definition Classes
    StructuredAlgorithm
  57. final def notify(): Unit
    Definition Classes
    AnyRef
  58. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  59. def posteriorElement[T](target: Element[T], universe: Universe = Universe.universe): Element[T]

    Return an element representing the posterior probability distribution of the given element.

    Return an element representing the posterior probability distribution of the given element.

    Definition Classes
    ProbQueryAlgorithm
  60. def probability[T](target: Element[T], value: T): Double

    Return an estimate of the probability that the target produces the value.

    Return an estimate of the probability that the target produces the value. Throws NotATargetException if called on a target that is not in the list of targets of the algorithm. Throws AlgorithmInactiveException if the algorithm is inactive.

    Definition Classes
    BaseProbQueryAlgorithm
  61. def probability[T](target: Element[T])(predicate: (T) ⇒ Boolean, c: Any = DummyImplicit): Double

    Return an estimate of the probability of the predicate under the marginal probability distribution of the target.

    Return an estimate of the probability of the predicate under the marginal probability distribution of the target. Throws NotATargetException if called on a target that is not in the list of targets of the algorithm. Throws AlgorithmInactiveException if the algorithm is inactive.

    Definition Classes
    BaseProbQueryAlgorithm
  62. def probability[T](target: Element[T], predicate: (T) ⇒ Boolean): Double

    Return an estimate of the probability of the predicate under the marginal probability distribution of the target.

    Return an estimate of the probability of the predicate under the marginal probability distribution of the target. Throws NotATargetException if called on a target that is not in the list of targets of the algorithm. Throws AlgorithmInactiveException if the algorithm is inactive.

    Definition Classes
    BaseProbQueryAlgorithm
  63. def probabilityBounds[T](target: Element[T], value: T): (Double, Double)
    Definition Classes
    BoundsProbQueryAlgorithm
  64. def probabilityBounds[T](target: Element[T], predicate: (T) ⇒ Boolean): (Double, Double)

    Return an estimate of the probability of the bounds on the predicate under the marginal probability distribution of the target.

    Return an estimate of the probability of the bounds on the predicate under the marginal probability distribution of the target.

    target

    Element for which to compute bounds.

    predicate

    Function whose probability of evaluating to true is computed.

    returns

    Bounds on the probability of this function for this element.

    Definition Classes
    BoundsProbQueryAlgorithm
    Exceptions thrown

    AlgorithmInactiveException if the algorithm is inactive.

    NotATargetException if called on a target that is not in the list of targets of the algorithm.

  65. val problem: Problem

    Inference problem to be solved.

    Inference problem to be solved.

    Definition Classes
    StructuredAlgorithm
  66. def problemTargets: List[Element[_]]

    List of targets that should not be eliminated when solving the problem.

    List of targets that should not be eliminated when solving the problem.

    returns

    Targets for the problem.

    Definition Classes
    StructuredProbQueryAlgorithmStructuredAlgorithm
  67. def processSolutions(solutions: Map[Bounds, Solution]): Unit

    Extract the solution in a way that allows fast queries to the algorithm.

    Extract the solution in a way that allows fast queries to the algorithm. This usually involves storing some form of the solution in a variable, but the exact implementation is up to the algorithm that overrides this.

    solutions

    A map from bounds to computed solutions for those bounds. Contains one key for each of the bounds needed, according to neededBounds().

    Definition Classes
    StructuredProbQueryAlgorithmStructuredAlgorithm
  68. val queryTargets: Element[_]*
  69. def rangingStrategy: RangingStrategy

    Uses the default lazy ranging strategy with one value per iteration.

    Uses the default lazy ranging strategy with one value per iteration.

    Definition Classes
    AnytimeLSVEAnytimeLazyStructuredAnytimeStructuredStructuredAlgorithm
  70. def refiningStrategy(): RefiningStrategy

    Strategy to use for refinement at a single iteration.

    Strategy to use for refinement at a single iteration. This may return a new strategy for each iteration.

    returns

    A refining strategy to be used for a single iteration.

    Definition Classes
    LazyStructuredVEStructuredAlgorithm
  71. def regularAndStarBounds[T](lowerFactor: Factor[Double], upperFactor: Factor[Double]): (List[(Double, Double, T)], Double, Double)

    Computes bounds on each regular and extended value given lower and upper factors marginalized to a single variable.

    Computes bounds on each regular and extended value given lower and upper factors marginalized to a single variable. The first entry contains bounds on each regular value as a list of triples (lower, upper, value). The second and third entries are, respectively, the lower and upper bounds on *. These are bounds on the probability mass that could be placed on values not yet in the range of the target.

    Attributes
    protected
    Definition Classes
    LazyStructuredProbQueryAlgorithm
  72. def resume(): Unit

    Resume the computation of the algorithm, if it has been stopped.

    Resume the computation of the algorithm, if it has been stopped. Throws AlgorithmInactiveException if the algorithm is not active.

    Definition Classes
    Algorithm
  73. def runStep(): Unit

    Run a single iteration of refinement/solving, then record the solutions.

    Run a single iteration of refinement/solving, then record the solutions.

    Definition Classes
    StructuredAlgorithm
  74. val runner: ActorRef
    Definition Classes
    Anytime
  75. val running: Boolean
    Definition Classes
    Anytime
  76. def shutdown: Unit

    Release all resources from this anytime algorithm.

    Release all resources from this anytime algorithm.

    Definition Classes
    Anytime
  77. def solvingStrategy(): SolvingStrategy

    Strategy to use for solving at a single iteration.

    Strategy to use for solving at a single iteration. This may return a new strategy for each iteration.

    returns

    A solving strategy to be used for a single iteration.

    Definition Classes
    LazyStructuredVEStructuredAlgorithm
  78. def start(): Unit

    Start the algorithm and make it active.

    Start the algorithm and make it active. After it returns, the algorithm must be ready to provide answers. Throws AlgorithmActiveException if the algorithm is already active.

    Definition Classes
    Algorithm
  79. def stop(): Unit

    Stop the algorithm from computing.

    Stop the algorithm from computing. The algorithm is still ready to provide answers after it returns. Throws AlgorithmInactiveException if the algorithm is not active.

    Definition Classes
    Algorithm
  80. def stopUpdate(): Unit

    Optional function to run when the algorithm is stopped (not killed).

    Optional function to run when the algorithm is stopped (not killed). Used in samplers to update lazy values.

    Definition Classes
    Anytime
  81. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  82. val system: ActorSystem
    Definition Classes
    Anytime
  83. var targetFactors: Map[Bounds, Map[Element[_], Factor[Double]]]
    Attributes
    protected
    Definition Classes
    StructuredProbQueryAlgorithm
  84. def toString(): String
    Definition Classes
    AnyRef → Any
  85. val universe: Universe
    Definition Classes
    StructuredAlgorithm
  86. def useBoundsString: String
    Attributes
    protected
    Definition Classes
    LazyStructuredProbQueryAlgorithmStructuredProbQueryAlgorithm
  87. def variance(target: Element[Double]): Double

    Return the variance of the probability density function for the given continuous element.

    Return the variance of the probability density function for the given continuous element.

    Definition Classes
    BaseProbQueryAlgorithm
  88. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  89. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  90. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnytimeBoundsProbQuery

Inherited from AnytimeProbQuery

Inherited from AnytimeLazyStructured

Inherited from AnytimeStructured

Inherited from Anytime

Inherited from LazyStructuredVE

Inherited from BoundsProbQueryAlgorithm

Inherited from LazyStructured

Inherited from ProbQueryAlgorithm

Inherited from StructuredAlgorithm

Inherited from Algorithm

Inherited from AnyRef

Inherited from Any

Ungrouped