Sciweavers

422 search results - page 34 / 85
» On Non-Approximability for Quadratic Programs
Sort
View
ENTCS
2006
111views more  ENTCS 2006»
13 years 8 months ago
A Verified Compiler for Synchronous Programs with Local Declarations
In addition to efficient code generation, causality cycles and schizophrenic statements are major problems for the compilation of synchronous programs. Although these problems are ...
Klaus Schneider, Jens Brandt, Tobias Schüle
ASP
2001
Springer
14 years 16 days ago
Useful Transformations in Answer set programming
We define a reduction system Ë¿ which preserves the stable semantics. This system includes two types of transformation rules. One type (which we call ˾) preserves the stable...
Mauricio Osorio, Juan Carlos Nieves, Chris Giannel...
IJCNN
2006
IEEE
14 years 2 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
JMLR
2006
175views more  JMLR 2006»
13 years 8 months ago
Learning Sparse Representations by Non-Negative Matrix Factorization and Sequential Cone Programming
We exploit the biconvex nature of the Euclidean non-negative matrix factorization (NMF) optimization problem to derive optimization schemes based on sequential quadratic and secon...
Matthias Heiler, Christoph Schnörr
CPAIOR
2010
Springer
14 years 25 days ago
Strong Combination of Ant Colony Optimization with Constraint Programming Optimization
We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using...
Madjid Khichane, Patrick Albert, Christine Solnon