2089 search results - page 249 / 418 » A New Problem in String Searching |
102
click to vote
ICIP
2007
IEEE
15 years 9 months ago
2007
IEEE
In this paper a novel non-linear subspace method for face verification is proposed. The problem of face verification is considered as a two-class problem (genuine versus imposto...
134
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
In this paper, we utilize a predator-prey model in order to identify characteristics of single-objective variation operators in the multi-objective problem domain. In detail, we a...
129
click to vote
SYNASC
2005
IEEE
15 years 8 months ago
2005
IEEE
Particle Swarm Optimization (PSO) technique proved its ability to deal with very complicated optimization and search problems. This paper proposes a new particle swarm variant whi...
115
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
This paper empirically investigates parallel competent genetic algorithms (cGAs) [4]. cGAs, such as BOA [21], LINCGA [15], D5 -GA [28], can solve GA-difficult problems by automati...
113
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
In order to solve nonstationary optimization problems efficiently, evolutionary algorithms need sufficient diversity to adapt to environmental changes. The dual-population genetic...