895 search results - page 40 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
CORR
2008
Springer
14 years 11 months ago
2008
Springer
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...
HIS
2003
15 years 6 days ago
2003
Abstract. Genetic algorithms (GAs) are a class of search algorithms based on principles of natural evolution. Hence, incorporating mechanisms used in nature may improve the perform...
102
click to vote
CONSTRAINTS
2007
14 years 10 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
AAAI
2008
15 years 1 months ago
2008
Identifying maternal and paternal inheritance is essential to be able to find the set of genes responsible for a particular disease. Although we have access to genotype data (gene...
106
Voted
TSMC
2011
14 years 5 months ago
2011
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...