895 search results - page 95 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
GECCO
2006
Springer
15 years 2 months ago
2006
Springer
The design of hash functions by means of evolutionary computation is a relatively new and unexplored problem. In this work, we use Genetic Programming (GP) to evolve robust and fa...
GECCO
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. Training neural networks is a complex task of great importance in the supervised learning field of research. In this work we tackle this problem with five algorithms, a...
APN
2005
Springer
15 years 4 months ago
2005
Springer
The topic of process mining has attracted the attention of both researchers and tool vendors in the Business Process Management (BPM) space. The goal of process mining is to discov...
123
click to vote
EC
2010
14 years 8 months ago
2010
Estimation of distribution algorithms (EDAs) that use marginal product model factorizations have been widely applied to a broad range of, mainly binary, optimization problems. In ...
TAMC
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...