2393 search results - page 347 / 479 » Bounds-Consistent Local Search |
92
Voted
WIAMIS
2009
IEEE
15 years 7 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 ...
106
click to vote
IEEEICCI
2009
IEEE
15 years 7 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...
94
Voted
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
Tetris is a falling block game where the player’s objective is to arrange a sequence of different shaped tetrominoes smoothly in order to survive. In the intelligence games, ag...
109
Voted
ICIC
2009
Springer
15 years 7 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...
102
Voted
ICNC
2009
Springer
15 years 7 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...