1603 search results - page 109 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
169
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
Various multi–objective evolutionary algorithms (MOEAs) have obtained promising results on various numerical multi– objective optimization problems. The combination with gradi...
194
click to vote
JMLR
2012
13 years 8 months ago
2012
Variable selection is an important and practical problem that arises in analysis of many high-dimensional datasets. Convex optimization procedures that arise from relaxing the NP-...
157
click to vote
PREMI
2005
Springer
15 years 12 months ago
2005
Springer
With the advent of efficient techniques for multi-objective evolutionary optimization (EMO), real-world search and optimization problems are being increasingly solved for mulitple ...
150
click to vote
CCCG
2006
15 years 7 months ago
2006
Given a simple polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a rigid motion placement of P that contains the maximum number of...
144
click to vote
AAAI
2010
15 years 7 months ago
2010
Multiple Kernel Learning (MKL) can be formulated as a convex-concave minmax optimization problem, whose saddle point corresponds to the optimal solution to MKL. Most MKL methods e...