1298 search results - page 5 / 260 » The online set cover problem |
ANTSW
2004
Springer
14 years 23 days 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 ...
ESA
2005
Springer
14 years 27 days ago
2005
Springer
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...
COCOON
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
CSC
2008
13 years 8 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
This paper presents a new type of genetic algorithm for the set covering problem. It differs from previous evolutionary approaches first because it is an indirect algorithm, i.e. ...