1628 search results - page 178 / 326 » Partitioning Sets with Genetic Algorithms |
135
Voted
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
This paper deals with the problem of comparing and testing evolutionary algorithms, that is, the benchmarking problem, from an analysis point of view. A practical study of the app...
124
Voted
ML
2010
ACM
15 years 2 months ago
2010
ACM
This paper presents a cooperative evolutionary approach for the problem of instance selection for instance based learning. The presented model takes advantage of one of the most r...
139
click to vote
ESA
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
146
Voted
KES
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. The aim of this work is to forecast future events in financial data sets, in particular, we focus our attention on situations where positive instances are rare, which fal...
134
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...