895 search results - page 88 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
EVOW
2006
Springer
15 years 2 months ago
2006
Springer
In this paper we investigate and compare multi-objective and weighted single objective approaches to a real world workforce scheduling problem. For this difficult problem we consid...
ASUNAM
2010
IEEE
15 years 19 days ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
This paper analyzes the scalability of the population size required in XCS to maintain niches that are infrequently activated. Facetwise models have been developed to predict the ...
125
click to vote
GECCO
2005
Springer
15 years 4 months ago
2005
Springer
Evolutionary relationships among species can be represented by a phylogenetic tree and inferred by optimising some measure of fitness, such as the statistical likelihood of the t...
GECCO
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. Microarrays allow simultaneous measurement of the expression levels of thousands of genes in cells under different physiological or disease states. Because the number of...