989 search results - page 15 / 198 » Approximating the Pareto optimal set using a reduced set of ... |
EMO
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. The classic NFL theorems are invariably cast in terms of single objective optimization problems. We confirm that the classic NFL theorem holds for general multiobjective ...
IPMU
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as cons...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
ASAP
2004
IEEE
13 years 11 months ago
2004
IEEE
In this paper, we present a modular co-synthesis framework called CHARMED that solves the problem of hardware-software co-synthesis of periodic, multi-mode, distributed, embedded ...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
Hidden Markov Models (HMMs) model sequential data in many fields such as text/speech processing and biosignal analysis. Active learning algorithms learn faster and/or better by cl...