On the computational complexity of Dempster's Rule of combination, a parallel computing approach.
Mohammed BenallaBoujemâa AchchabHamid HrimechPublished in: J. Comput. Sci. (2021)
Keyphrases
- parallel computing
- computational complexity
- combination rule
- massively parallel
- parallel computation
- computing systems
- high performance computing
- dempster shafer theory
- computer architecture
- evidence theory
- parallel computers
- shared memory
- parallel machines
- processing units
- field programmable gate array
- parallel programming
- np hard
- embedded systems
- parallel algorithm
- computer systems
- scheduling problem
- dynamic programming
- pairwise