6095 search results - page 834 / 1219 » Learning in Local Search |
185
click to vote
CEC
2009
IEEE
16 years 1 months ago
2009
IEEE
—This paper presents the evolutionary programming with an ensemble of memories to deal with optimization problems in dynamic environments. The proposed algorithm modifies a recen...
176
click to vote
WIAMIS
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper, we consider the challenging problem of object duplicate detection and localization. Several applications require efficient object duplicate detection methods, such ...
192
click to vote
IEEEICCI
2009
IEEE
16 years 1 months ago
2009
IEEE
The OpenBiomind toolkit is used to apply GA, GP and local search methods to analyze a large SNP dataset concerning late-onset Alzheimers disease (LOAD). Classification models iden...
197
click to vote
ICIC
2009
Springer
16 years 1 months ago
2009
Springer
Sequence Alignment is a basic information disposal method in Bioinformatics. However, it is difficult to deal with multiple sequence alignment problem(MSA). In this paper, an impro...
172
click to vote
ICNC
2009
Springer
16 years 1 months ago
2009
Springer
—Genetic algorithm (GA) is too dependent on the initial population and a lack of local search ability. In this paper, an improved greedy genetic algorithm (IGAA) is proposed to o...