Sciweavers

2436 search results - page 66 / 488
» Evaluating Adaptive Problem Selection
Sort
View
ECAI
2004
Springer
14 years 2 months ago
Learning Techniques for Automatic Algorithm Portfolio Selection
The purpose of this paper is to show that a well known machine learning technique based on Decision Trees can be effectively used to select the best approach (in terms of efficien...
Alessio Guerri, Michela Milano
ICANN
2007
Springer
14 years 22 days ago
Active Learning to Support the Generation of Meta-examples
Meta-Learning has been used to select algorithms based on the features of the problems being tackled. Each training example in this context, i.e. each meta-example, stores the feat...
Ricardo Bastos Cavalcante Prudêncio, Teresa ...
GECCO
2003
Springer
111views Optimization» more  GECCO 2003»
14 years 2 months ago
An Adaptive Penalty Scheme for Steady-State Genetic Algorithms
A parameter-less adaptive penalty scheme for steady-state genetic algorithms applied to constrained optimization problems is proposed. For each constraint, a penalty parameter is a...
Helio J. C. Barbosa, Afonso C. C. Lemonge
MP
2002
143views more  MP 2002»
13 years 8 months ago
Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
François Vanderbeck
ICIP
2006
IEEE
14 years 10 months ago
Precision-Oriented Active Selection for Interactive Image Retrieval
Active learning methods have been considered with an increased interest in the content-based image retrieval (CBIR) community. Those methods used to be based on classical classifi...
Philippe Henri Gosselin, Matthieu Cord