895 search results - page 64 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
GECCO
2000
Springer
15 years 2 months ago
2000
Springer
It has been argued that optimal per-locus mutation rates in GAs are proportional to selection pressure and the reciprocal of genotype length. In this paper we suggest that the not...
ISCAS
2006
IEEE
15 years 5 months ago
2006
IEEE
The efficient design of multiplierless implementa- The goal is to find the optimal sub-expressions across all N dot tions of constant matrix multipliers is challenged by the huge p...
GECCO
2005
Springer
15 years 4 months ago
2005
Springer
In this paper we present a genetic algorithm applied to the problem of mission planning for Joint Suppression of Enemy Air Defenses (JSEAD) in support of air strike operations. Th...
COR
2007
14 years 11 months ago
2007
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
107
click to vote
FSTTCS
2004
Springer
15 years 4 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...