Sciweavers

29 search results - page 3 / 6
» Convex approximations for a class of mixed-integer recourse ...
Sort
View
CCO
2001
Springer
168views Combinatorics» more  CCO 2001»
13 years 10 months ago
Mathematical Programming Models and Formulations for Deterministic Production Planning Problems
Abstract. We study in this lecture the literature on mixed integer programming models and formulations for a specific problem class, namely deterministic production planning probl...
Yves Pochet
AUTOMATICA
1999
145views more  AUTOMATICA 1999»
13 years 5 months ago
Control of systems integrating logic, dynamics, and constraints
This paper proposes a framework for modeling and controlling systems described by interdependent physical laws, logic rules, and operating constraints, denoted as mixed logical dy...
Alberto Bemporad, Manfred Morari
ICML
2008
IEEE
14 years 6 months ago
Nearest hyperdisk methods for high-dimensional classification
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...
Hakan Cevikalp, Bill Triggs, Robi Polikar
SIAMNUM
2010
96views more  SIAMNUM 2010»
13 years 14 days ago
On the Strong Convergence of Gradients in Stabilized Degenerate Convex Minimization Problems
Infimizing sequences in nonconvex variational problems typically exhibit enforced finer and finer oscillations called microstructures such that the infimal energy is not attained. ...
Wolfgang Boiger, Carsten Carstensen
JMLR
2010
125views more  JMLR 2010»
13 years 16 days ago
Maximum Likelihood in Cost-Sensitive Learning: Model Specification, Approximations, and Upper Bounds
The presence of asymmetry in the misclassification costs or class prevalences is a common occurrence in the pattern classification domain. While much interest has been devoted to ...
Jacek P. Dmochowski, Paul Sajda, Lucas C. Parra