We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
Abstract. Interest in role-based access control has generated considerable research activity in recent years. A number of interesting problems related to the well known set cover p...
Abstract. In this paper we present a study of several Ant Colony Optimization (ACO) algorithms for the Set Covering Problem. In our computational study we emphasize the influence ...
—While many cybersecurity tools are available to computer users, their default configurations often do not match needs of specific users. Since most modern users are not computer...