StructuredVEBPChooser

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. def apply(scoreThreshold: Double, BPIterations: Int, targets: Element[_]*): StructuredVEBPChooser

   

   Create a hybrid algorithm that chooses between variable elimination and belief propagation on each subproblem.

   Create a hybrid algorithm that chooses between variable elimination and belief propagation on each subproblem.

   scoreThreshold

   The minimum value of the increase in score caused by eliminating a variable that causes the hybrid algorithm to choose BP for a subproblem.

   targets

   The query targets

5. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

6. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

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

   

   Definition Classes

   AnyRef

8. def equals(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

9. def finalize(): Unit

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( classOf[java.lang.Throwable] )

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

    

    Definition Classes

    AnyRef → Any

11. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

12. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

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

    

    Definition Classes

    AnyRef

14. final def notify(): Unit

    

    Definition Classes

    AnyRef

15. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

16. def probability[T](target: Element[T], value: T, threshold: Double = 0.0, iterations: Int = 100): Double

    

    Use the hybrid algorithm to compute the probability that the given element has the given value.

17. def probability[T](target: Element[T], predicate: (T) ⇒ Boolean, threshold: Double, iterations: Int): Double

    

    Use the hybrid algorithm to compute the probability that the given element satisfies the given predicate.

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

    

    Definition Classes

    AnyRef

19. def toString(): String

    

    Definition Classes

    AnyRef → Any

20. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )