895 search results - page 101 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
103
click to vote
IWDC
2005
Springer
15 years 4 months ago
2005
Springer
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
122
click to vote
WIOPT
2006
IEEE
15 years 5 months ago
2006
IEEE
Abstract— An important application of wireless sensor networks is to perform the monitoring missions, for example, to monitor some targets of interests at all times. Sensors are ...
SDM
2009
SIAM
15 years 8 months ago
2009
SIAM
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
CSCLP
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...