2436 search results - page 134 / 488 » Evaluating Adaptive Problem Selection |
127
Voted
GECCO
2008
Springer
15 years 3 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...
125
Voted
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
This paper investigates how the Univariate Marginal Distribution Algorithm (UMDA) behaves in non-stationary environments when engaging in sampling and selection strategies designe...
122
Voted
IPPS
1997
IEEE
15 years 6 months ago
1997
IEEE
This paper analyses alternatives for the parallelization of the Simulated Annealing algorithm when applied to the placement of modules in a VLSI circuit considering the use of PVM...
139
Voted
KDD
2002
ACM
16 years 3 months ago
2002
ACM
Instance selection and feature selection are two orthogonal methods for reducing the amount and complexity of data. Feature selection aims at the reduction of redundant features i...
134
Voted
CIKM
2009
Springer
15 years 6 months ago
2009
Springer
In some retrieval situations, a system must search across multiple collections. This task, referred to as federated search, occurs for example when searching a distributed index o...