895 search results - page 35 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
119
click to vote
FOGA
2011
14 years 2 months ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
ESWA
2006
14 years 10 months ago
2006
The paper demonstrates the efficient use of hybrid intelligent systems for solving the classification problem of bankruptcy. The aim of the study is to obtain classification schem...
CEC
2007
IEEE
15 years 2 months ago
2007
IEEE
Abstract-- Shotgun sequencing is the state-of-the-art to decode genome sequence. However this technique needs a lot of fragments. Combining those fragments correctly requires enorm...
WINE
2009
Springer
15 years 5 months ago
2009
Springer
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
CCCG
2007
15 years 4 days ago
2007
Given a set P of n points in R2 , we consider two related problems. Firstly, we study the problem of computing two isothetic unit squares which may be either disjoint or intersect...