955 search results - page 5 / 191 » Cover Set Problem in Directional Sensor Networks |
CORR
2008
Springer
14 years 9 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. ...
ISAAC
2004
Springer
15 years 2 months ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
AAIM
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity con...
WINE
2005
Springer
15 years 3 months ago
2005
Springer
Owing to numerous potential applications, wireless sensor networks have been the focus of a lot of research efforts lately. In this note we study one fundamental issue in such net...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
