Sciweavers

407 search results - page 57 / 82
» Optimization of Linear Logic Programs Using Counting Methods
Sort
View
MP
2002
195views more  MP 2002»
14 years 9 months ago
Nonlinear rescaling vs. smoothing technique in convex optimization
We introduce an alternative to the smoothing technique approach for constrained optimization. As it turns out for any given smoothing function there exists a modification with part...
Roman A. Polyak
ANOR
2002
67views more  ANOR 2002»
14 years 9 months ago
An Improved Hybrid Model for the Generic Hoist Scheduling Problem
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
Daniel Riera, Neil Yorke-Smith
INFORMS
2010
177views more  INFORMS 2010»
14 years 8 months ago
Binarized Support Vector Machines
The widely used Support Vector Machine (SVM) method has shown to yield very good results in Supervised Classification problems. Other methods such as Classification Trees have bec...
Emilio Carrizosa, Belen Martin-Barragan, Dolores R...
CVPR
2010
IEEE
14 years 8 months ago
Efficient computation of robust low-rank matrix approximations in the presence of missing data using the L1 norm
The calculation of a low-rank approximation of a matrix is a fundamental operation in many computer vision applications. The workhorse of this class of problems has long been the ...
Anders Eriksson, Anton van den Hengel
FOCS
2005
IEEE
15 years 3 months ago
Sampling-based Approximation Algorithms for Multi-stage Stochastic
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...
Chaitanya Swamy, David B. Shmoys