155 search results - page 12 / 31 » A Comparison Between ACO Algorithms for the Set Covering Pro... |
212
Voted
ICCV
2011
IEEE
14 years 2 months ago
2011
IEEE
This paper presents a novel formulation, which derives in a smooth minimization problem, to tackle the rigid registration between a given point set and a model set. Unlike most of ...
100
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
Typical domains used in machine learning analyses only partially cover the complexity space, remaining a large proportion of problem difficulties that are not tested. Since the ac...
116
Voted
GRC
2008
IEEE
15 years 4 months ago
2008
IEEE
Feature selection is an important problem for pattern classification systems. Mutual information is a good indicator of relevance between variables, and has been used as a measure...
143
Voted
KDD
2000
ACM
15 years 7 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
123
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
There exist a number of high-performance Multi-Objective Evolutionary Algorithms (MOEAs) for solving MultiObjective Optimization (MOO) problems; two of the best are NSGA-II and -M...