1830 search results - page 30 / 366 » Optimizing Sorting with Genetic Algorithms |
CEC
2010
IEEE
14 years 10 months ago
2010
IEEE
— This paper presents the G3PARM algorithm for mining representative association rules. G3PARM is an evolutionary algorithm that uses G3P (Grammar Guided Genetic Programming) and...
ALGORITHMICA
2008
14 years 9 months ago
2008
In this paper we investigate the design and analysis of algorithms resilient to memory faults. We focus on algorithms that, despite the corruption of some memory values during the...
JCSS
2008
14 years 9 months ago
2008
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
RECOMB
2009
Springer
15 years 4 months ago
2009
Springer
In genome rearrangements, the double cut and join (DCJ) operation, introduced by Yancopoulos et al., allows to represent most rearrangement events that could happen in multichromos...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...