6 search results - page 1 / 2 » On universal search strategies for multi-criteria optimizati... |
CEC
2011
IEEE
12 years 4 months ago
2011
IEEE
—We develop a stochastic local search algorithm for finding Pareto points for multi-criteria optimization problems. The algorithm alternates between different single-criterium o...
CIVR
2007
Springer
13 years 11 months ago
2007
Springer
The Carnegie Mellon University Informedia group has enjoyed consistent success with TRECVID interactive search using traditional storyboard interfaces for shot-based retrieval. Fo...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Two types of combining strategies were evaluated namely combining skin features and combining skin classifiers. Several combining rules were applied where the outputs of the skin ...
APPROX
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
ALENEX
2009
13 years 2 months ago
2009
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...