Sciweavers

1204 search results - page 105 / 241
» Termination of Polynomial Programs
Sort
View
MP
2010
150views more  MP 2010»
14 years 7 months ago
The algebraic degree of semidefinite programming
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minima...
Jiawang Nie, Kristian Ranestad, Bernd Sturmfels
HM
2007
Springer
120views Optimization» more  HM 2007»
15 years 6 months ago
On the Combination of Constraint Programming and Stochastic Search: The Sudoku Case
Sudoku is a notorious logic-based puzzle that is popular with puzzle enthusiasts the world over. From a computational perspective, Sudoku is also a problem that belongs to the set ...
Rhydian Lewis
104
Voted
ICPR
2002
IEEE
16 years 1 months ago
Trajectory Segmentation Using Dynamic Programming
We consider the segmentation of a trajectory into piecewise polynomial parts, or possibly other forms. Segmentation is typically formulated as an optimization problem which trades...
Richard Mann, Allan D. Jepson, Thomas F. El-Maragh...
81
Voted
IJCNN
2006
IEEE
15 years 6 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
117
Voted
CAV
2008
Springer
96views Hardware» more  CAV 2008»
15 years 2 months ago
Monitoring Atomicity in Concurrent Programs
We study the problem of monitoring concurrent program runs for atomicity violations. Unearthing fundamental results behind scheduling algorithms in database control, we build space...
Azadeh Farzan, P. Madhusudan