.png){kind=icon}
.png){kind=icon}
Return
Particle Swarm Optimization Algorithm for Detecting Distributed Predicates
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2021.3097182.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Detection algorithms
Particle swarm optimization
Licenses
Statistics
Sociology
Search problems
Runtime
Artificial intelligence
computational intelligence
debugging
distributed predicates detection
distributed systems
monitoring
particle swarm optimization
runtime verification
testing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W