4047 search results - page 191 / 810 » Some Properties and Some Problems on Set Functors |
173
click to vote
COLT
1999
Springer
15 years 10 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
178
click to vote
SIAMDM
2010
15 years 1 months ago
2010
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
177
click to vote
EMO
2003
Springer
15 years 11 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 ...
169
click to vote
GECCO
2008
Springer
15 years 7 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...
188
click to vote
COR
2007
15 years 6 months ago
2007
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...