Sciweavers

1776 search results - page 73 / 356
» Uncertain Linear Constraints
Sort
View
AUTOMATICA
2002
104views more  AUTOMATICA 2002»
14 years 9 months ago
Who needs QP for linear MPC anyway?
Conventional MPC uses quadratic programming (QP) to minimise, on-line, a cost over n linearly constrained control moves. However, stability constraints often require the use of la...
Basil Kouvaritakis, Mark Cannon, J. Anthony Rossit...
TSP
2008
105views more  TSP 2008»
14 years 9 months ago
Semi-Supervised Linear Spectral Unmixing Using a Hierarchical Bayesian Model for Hyperspectral Imagery
This paper proposes a hierarchical Bayesian model that can be used for semi-supervised hyperspectral image unmixing. The model assumes that the pixel reflectances result from linea...
Nicolas Dobigeon, Jean-Yves Tourneret, Chein-I Cha...
ACTA
2002
111views more  ACTA 2002»
14 years 9 months ago
Adding a path connectedness operator to FO+poly (linear)
In the constraint database community, FO+poly and FO+linear have been proposed as foundations for spatial database query languages. One of the strengths of this approach is that t...
Chris Giannella, Dirk Van Gucht
COR
2011
14 years 4 months ago
Faster integer-feasibility in mixed-integer linear programs by branching to force change
Branching in mixed-integer (or integer) linear programming requires choosing both the branching variable and the branching direction. This paper develops a number of new methods f...
Jennifer Pryor, John W. Chinneck
SODA
2008
ACM
71views Algorithms» more  SODA 2008»
14 years 11 months ago
Two-phase greedy algorithms for some classes of combinatorial linear programs
We present greedy algorithms for some classes of combinatorial packing and cover problems within the general formal framework of Hoffman and Schwartz' lattice polyhedra. Our ...
Ulrich Faigle, Britta Peis