Sciweavers

2861 search results - page 146 / 573
» Constraint Programming
Sort
View
OL
2011
177views Neural Networks» more  OL 2011»
14 years 26 days ago
Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of proce
In this paper we present a methodology for finding tight convex relaxations for a special set of quadratic constraints given by bilinear and linear terms that frequently arise in ...
Juan P. Ruiz, Ignacio E. Grossmann
MMSP
2008
IEEE
245views Multimedia» more  MMSP 2008»
15 years 4 months ago
A convex programming approach for color stereo matching
—This paper addresses the problem of dense disparity estimation from a pair of color stereo images. Based on a convex set theoretic formulation, the stereo matching problem is ca...
Wided Miled, Béatrice Pesquet-Popescu, Jean...
SAC
1998
ACM
15 years 2 months ago
Off-line scheduling of a real-time system
This paper shows how a recently introduced class of applications can be solved by constraint programming. This new type of application is due to the emergence of special real-time...
Klaus Schild, Jörg Würtz
CAV
2003
Springer
108views Hardware» more  CAV 2003»
15 years 3 months ago
Linear Invariant Generation Using Non-linear Constraint Solving
Abstract. We present a new method for the generation of linear invariants which reduces the problem to a non-linear constraint solving problem. Our method, based on Farkas’ Lemma...
Michael Colón, Sriram Sankaranarayanan, Hen...
CP
2009
Springer
15 years 4 months ago
Exploiting Problem Decomposition in Multi-objective Constraint Optimization
Multi-objective optimization is concerned with problems involving multiple measures of performance which should be optimized simultaneously. In this paper, we extend AND/OR Branch-...
Radu Marinescu