Sciweavers

3591 search results - page 144 / 719
» Typing linear constraints
Sort
View
IOR
2010
98views more  IOR 2010»
15 years 3 months ago
A Shadow Simplex Method for Infinite Linear Programs
We present a Simplex-type algorithm, that is, an algorithm that moves from one extreme point of the infinite-dimensional feasible region to another not necessarily adjacent extrem...
Archis Ghate, Dushyant Sharma, Robert L. Smith
CVPR
2010
IEEE
16 years 2 months ago
Estimation of Image Bias Field with Sparsity Constraints
We propose a new scheme to estimate image bias field through introducing two sparsity constraints. One is that the bias-free image has concise representation with image gradients o...
Yuanjie Zheng and James C. Gee
CPAIOR
2007
Springer
16 years 17 days ago
A Continuous Multi-resources cumulative Constraint with Positive-Negative Resource Consumption-Production
Abstract. This article first introduces an extension of the classical cumulative constraint: each task is no more a rectangle but rather a sequence of contiguous trapezoid sub-tas...
Nicolas Beldiceanu, Emmanuel Poder
CPAIOR
2005
Springer
15 years 12 months ago
Filtering Algorithms for the NValue Constraint
Abstract. The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We ...
Christian Bessière, Emmanuel Hebrard, Brahi...
ESA
2006
Springer
113views Algorithms» more  ESA 2006»
15 years 10 months ago
An LP-Designed Algorithm for Constraint Satisfaction
The class Max (r, 2)-CSP consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m binary clauses, we presen...
Alexander D. Scott, Gregory B. Sorkin