1208 search results - page 14 / 242 » Uniform eventown problems |
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
Although multi-objective GA (MOGA) is an efficient multiobjective optimization (MOO) method, it has some limitations that need to be tackled, which include unguaranteed uniformity...
COCOON
2006
Springer
15 years 1 months ago
2006
Springer
Assume that each vertex of a graph G is assigned a constant number q of nonnegative integer weights, and that q pairs of nonnegative integers li and ui, 1 i q, are given. One wis...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The knowledge of channel statistics can be very helpful in making sound opportunistic spectrum access decisions. It is therefore desirable to be able to efficiently and accurately...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
Abstract-- In evolutionary algorithms, the fitness of a population increases with time by mutating and recombining individuals and by a biased selection of more fit individuals. Th...
ECCC
2006
14 years 11 months ago
2006
We consider the problem of amplifying uniform average-case hardness of languages in NP, where hardness is with respect to BPP algorithms. We introduce the notion of monotone error...