Class

com.cra.figaro.algorithm.structured.strategy.solve

VEBPGibbsStrategy

Related Doc: package solve

Permalink

class VEBPGibbsStrategy extends SolvingStrategy

A solving strategy that chooses between VE, BP, and Gibbs based on a score of the elminiation order and determinism

Linear Supertypes
SolvingStrategy, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. VEBPGibbsStrategy
  2. SolvingStrategy
  3. AnyRef
  4. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Instance Constructors

  1. new VEBPGibbsStrategy(scoreThreshold: Double, determThreshold: Double, bpIters: Int, numSamples: Int, burnIn: Int, interval: Int, blockToSampler: BlockSamplerCreator)

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  5. val blockToSampler: BlockSamplerCreator

    Permalink

  6. val bpIters: Int

    Permalink

  7. val burnIn: Int

    Permalink

  8. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  9. val determThreshold: Double

    Permalink

  10. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  11. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  12. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  13. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  14. def hasDeterminism(problem: Problem, v: Variable[_]): Boolean

    Permalink

  15. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  16. val interval: Int

    Permalink

  17. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  18. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  19. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  20. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  21. val numSamples: Int

    Permalink

  22. val scoreThreshold: Double

    Permalink

  23. def solve(problem: Problem, toEliminate: Set[Variable[_]], toPreserve: Set[Variable[_]], factors: List[Factor[Double]]): List[Factor[Double]]

    Permalink

    Solve the given problem with the indicated preserve and eliminate variables, and return a list of factors representing the joint distribution over the preserved variables.

    Solve the given problem with the indicated preserve and eliminate variables, and return a list of factors representing the joint distribution over the preserved variables.

    Definition Classes
    VEBPGibbsStrategy → SolvingStrategy

  24. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef

  25. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  26. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  27. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  28. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from SolvingStrategy

Inherited from AnyRef

Inherited from Any

Ungrouped