Abstract: We desire to fuse a list of observations from sensor 1 to one at sensor 2. The data are unlabeled (i.e., permuted), such that it must be decided which data from sensor 1 should be fused with ...

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Solving the popular NP problem, The Subset Sum Problem, with an Amortized O(n) algorithm based on Recursive Backtracking. The Algorithm stood second fastest in the organized Intra-University ...

We consider applications of Subset Product Problem (SPP) in number theory and cryptography. We obtain a probabilistic algorithm that attack SPP and we analyze it with respect time/space complexity and ...

ABSTRACT: The 0/1 Multidimensional Knapsack Problem (0/1 MKP) is an interesting NP-hard combinatorial optimization problem that can model a number of challenging applications in logistics, finance, ...

Discrete combinatorial optimization has a central role in many scientific disciplines, however, for hard problems we lack linear time algorithms that would allow us to solve very large instances.

A source of controversy for many years, the cancer stem cell concept is looking stronger now that genetic analysis of a particular kind of cancer—myelodysplastic syndrome—has revealed that rare ...