Sciweavers

62 search results - page 11 / 13
» Optimal BSR Solutions to Several Convex Polygon Problems
Sort
View
4OR
2010
137views more  4OR 2010»
13 years 7 months ago
Extended formulations in combinatorial optimization
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...
Michele Conforti, Gérard Cornuéjols,...
NIPS
2007
13 years 9 months ago
Multi-Task Learning via Conic Programming
When we have several related tasks, solving them simultaneously is shown to be more effective than solving them individually. This approach is called multi-task learning (MTL) and...
Tsuyoshi Kato, Hisashi Kashima, Masashi Sugiyama, ...
SIAMJO
2000
101views more  SIAMJO 2000»
13 years 7 months ago
An Efficient Algorithm for Minimizing a Sum of p-Norms
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
Guoliang Xue, Yinyu Ye
ICCAD
2004
IEEE
155views Hardware» more  ICCAD 2004»
14 years 4 months ago
Robust analog/RF circuit design with projection-based posynomial modeling
In this paper we propose a RObust Analog Design tool (ROAD) for post-tuning analog/RF circuits. Starting from an initial design derived from hand analysis or analog circuit synthe...
Xin Li, Padmini Gopalakrishnan, Yang Xu, Lawrence ...
JSAC
2008
109views more  JSAC 2008»
13 years 6 months ago
Elastic service availability: utility framework and optimal provisioning
Service availability is one of the most closely scrutinized metrics in offering network services. It is important to cost-effectively provision a managed and differentiated networ...
Dahai Xu, Ying Li, Mung Chiang, A. Robert Calderba...