240 search results - page 36 / 48 » Nonconvex Robust Optimization for Problems with Constraints |
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
In this paper we present the use of a previously developed single-objective optimization approach, together with the -constraint method, to provide an approximation of the Pareto ...
TASE
2008
IEEE
13 years 7 months ago
2008
IEEE
This work intends to deal with the optimal kinematic synthesis problem of parallel manipulators under a unified framework. Observing that regular (e.g., hyper-rectangular) workspac...
SIGECOM
2010
ACM
14 years 9 days ago
2010
ACM
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
NIPS
2007
13 years 9 months ago
2007
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
We propose a convex framework for silhouette and stereo fusion in 3D reconstruction from multiple images. The key idea is to show that the reconstruction problem can be cast as one...