In information fusion, aggregations with various backgrounds require a variety of integrals to handle. These integrals are generally nonlinear since the set functions used are nonadditive in many real problems. In this study, the set functions considered are nonnegative and vanishing at the empty se
The computation of hitting sets: Review and new algorithms
β Scribed by Li Lin; Yunfei Jiang
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 116 KB
- Volume
- 86
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
β¦ Synopsis
In model-based diagnosis or other research fields, the hitting sets of a set cluster are usually used. In this paper we introduce some algorithms, including the new BHS-tree and Boolean algebraic algorithms. In the BHS-tree algorithm, a binary-tree is used for the computation of hitting sets, and in the Boolean algebraic algorithm, components are represented by Boolean variables. It runs just for one time to catch the minimal hitting sets. We implemented the algorithms and present empirical results in order to show their superiority over other algorithms for computing hitting sets.
π SIMILAR VOLUMES
In this paper, we study a dimensionally scaled helium atom model for excited states of helium. The mathematical analysis of the corresponding effective energy potential is presented. Two simple numerical algorithms are developed for the computation of the excited states of helium. Comparison between