994 search results - page 2 / 199 » Custom Computing Machines for the Set Covering Problem |
SPAA
2010
ACM
13 years 10 months ago
2010
ACM
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...
ICALP
2004
Springer
13 years 10 months ago
2004
Springer
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 ...
ESORICS
2009
Springer
14 years 6 months ago
2009
Springer
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...
ANTSW
2004
Springer
13 years 11 months ago
2004
Springer
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 ...
SMC
2010
IEEE
13 years 3 months ago
2010
IEEE
—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...