Abstract
Metaheuristic algorithms are widely used to solve NP-complete problems in several domains. Distributed predicates detection is a fundamental distributed systems problem that has many useful applications. The problem of distributed predicates detection, in general, is known to be an NP-complete problem. In this paper, we developed a detection algorithm inspired by the particle swarm optimization algorithm, one of the well-known metaheuristic algorithms applied to solve problems in several domains. The proposed detection algorithm deal with distributed predicates under the possibly modality. We compared the performance of the proposed distributed predicates detection algorithm with several other detection algorithms. The experimental results reveal the effectiveness of the suggested distributed predicates detection algorithm.