Abstract. In this paper we present an approach for specifying and prioritizing information security requirements in organizations. It is important to prioritize security requiremen...
We explore the intricate interdependent relationship among counting problems, considered from three frameworks for such problems: Holant Problems, counting CSP and weighted H-color...
The distributed partitioning of autonomous, self-aware nodes into cooperative groups, within which scarce resources could be effectively shared for the benefit of the group, is ...
The problem of partner finding is to identify which entities (agents) can provide requested services from a group of entities. It can be found in open and distributed environment...
In the standard formalization of supervised learning problems, a datum is represented as a vector of features without prior knowledge about relationships among features. However, ...