treeFast: TreeFast is an algorithm aimed to optimize the computation of...
In RAPLER/dst-1: Using the Theory of Belief Functions
treeFast R Documentation
TreeFast is an algorithm aimed to optimize the computation of multiple support functions defined on very large frames of discernment
Description
TreeFast is an algorithm aimed to optimize the computation of multiple support functions defined on very large frames of discernment
RAPLER/dst-1 documentation built on June 2, 2025, 9:22 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
| treeFast | R Documentation |
TreeFast is an algorithm aimed to optimize the computation of multiple support functions defined on very large frames of discernment
Description
TreeFast is an algorithm aimed to optimize the computation of multiple support functions defined on very large frames of discernment
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.