895 search results - page 66 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
152
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
169
click to vote
EVOW
2007
Springer
15 years 10 months ago
2007
Springer
RND (Radio Network Design) is a Telecommunication problem consisting in covering a certain geographical area by using the smallest number of radio antennas achieving the biggest co...
175
click to vote
SIAMCOMP
1998
15 years 5 months ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
154
click to vote
JCP
2007
15 years 6 months ago
2007
— Following a toxic contaminant release, either accidental or intentional, predicting the transport and dispersion of the contaminant becomes a critical problem for Homeland Defe...
191
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...