Sciweavers

299 search results - page 37 / 60
» Optimizing Polynomial Solvers for Minimal Geometry Problems
Sort
View
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
13 years 9 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova
IMCSIT
2010
13 years 5 months ago
Efficient Portfolio Optimization with Conditional Value at Risk
The portfolio optimization problem is modeled as a mean-risk bicriteria optimization problem where the expected return is maximized and some (scalar) risk measure is minimized. In ...
Wlodzimierz Ogryczak, Tomasz Sliwinski
COLT
2004
Springer
14 years 1 months ago
Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
H. Brendan McMahan, Avrim Blum
SIAMJO
2010
127views more  SIAMJO 2010»
13 years 2 months ago
Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning
We consider a recently proposed optimization formulation of multi-task learning based on trace norm regularized least squares. While this problem may be formulated as a semidefini...
Ting Kei Pong, Paul Tseng, Shuiwang Ji, Jieping Ye
ISQED
2010
IEEE
177views Hardware» more  ISQED 2010»
14 years 2 months ago
Multi-corner, energy-delay optimized, NBTI-aware flip-flop design
With the CMOS transistors being scaled to sub 45nm and lower, Negative Bias Temperature Instability (NBTI) has become a major concern due to its impact on PMOS transistor aging pr...
Hamed Abrishami, Safar Hatami, Massoud Pedram