Sciweavers

578 search results - page 5 / 116
» The Minimum-Entropy Set Cover Problem
Sort
View
FGCN
2007
IEEE
149views Communications» more  FGCN 2007»
14 years 1 months ago
Cover Set Problem in Directional Sensor Networks
— A directional sensor network consists of a number of directional sensors, which can switch to several directions to extend their sensing ability to cover the interested targets...
Yanli Cai, Wei Lou, Minglu Li
ICDT
2005
ACM
128views Database» more  ICDT 2005»
14 years 1 months ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
ANTSW
2004
Springer
14 years 27 days ago
A Comparison Between ACO Algorithms for the Set Covering Problem
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 ...
Lucas Lessing, Irina Dumitrescu, Thomas Stütz...
STOC
2003
ACM
98views Algorithms» more  STOC 2003»
14 years 7 months ago
The online set cover problem
Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbi...
ESA
2005
Springer
146views Algorithms» more  ESA 2005»
14 years 1 months ago
An Approximation Algorithm for the Minimum Latency Set Cover Problem
The input to the minimum latency set cover problem (MLSC) consists of a set of jobs and a set of tools. Each job j needs a specific subset Sj of the tools in order to be processed...
Refael Hassin, Asaf Levin