Sciweavers

519 search results - page 9 / 104
» A New Approach to Strongly Polynomial Linear Programming
Sort
View
IJCNN
2006
IEEE
15 years 7 months ago
Learning to Rank by Maximizing AUC with Linear Programming
— Area Under the ROC Curve (AUC) is often used to evaluate ranking performance in binary classification problems. Several researchers have approached AUC optimization by approxi...
Kaan Ataman, W. Nick Street, Yi Zhang
DAM
2010
120views more  DAM 2010»
15 years 1 months ago
A new approximation algorithm for the multilevel facility location problem
In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP rounding. The linear ...
Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren
VLSID
1999
IEEE
111views VLSI» more  VLSID 1999»
15 years 5 months ago
A New Approach for CMOS Op-Amp Synthesis
A new approach for CMOS op-amp circuit synthesis has proposed here. The approach is based on the observation that the rst order behavior of a MOS transistor in the saturation regi...
Pradip Mandal, V. Visvanathan
98
Voted
IROS
2009
IEEE
159views Robotics» more  IROS 2009»
15 years 8 months ago
Hiding real-time: A new approach for the software development of industrial robots
—Software development for industrial robots is still strongly limited by the use of old-style robot programming languages. These languages are tailored to meet a special requirem...
Alwin Hoffmann, Andreas Angerer, Frank Ortmeier, M...
SIAMJO
2010
112views more  SIAMJO 2010»
14 years 8 months ago
A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints
We present a general semidefinite relaxation scheme for general n-variate quartic polynomial optimization under homogeneous quadratic constraints. Unlike the existing sum-of-squar...
Zhi-Quan Luo, Shuzhong Zhang