In this paper, we present a greedy-based algorithm for matching UML class diagrams based on their lexical, internal, neighborhood similarity, and a combination of them. Additionally the paper ...

However, the SET K-Cover problem has not been widely researched in HWSNs. Hence, we introduce three kinds of simple pure distributed algorithms named greedy game algorithms (GGAs) based on game theory ...