Sciweavers

7092 search results - page 23 / 1419
» Parallelizing constraint programs
Sort
View
PPDP
2007
Springer
14 years 3 months ago
Unfolding in CHR
Program transformation is an appealing technique which allows to improve run-time efficiency, space-consumption and more generally to optimize a given program. Essentially it con...
Paolo Tacchella, Maurizio Gabbrielli, Maria Chiara...
CRV
2006
IEEE
223views Robotics» more  CRV 2006»
14 years 3 months ago
Disparity Map Estimation Using A Total Variation Bound
This paper describes a new variational method for estimating disparity from stereo images. The stereo matching problem is formulated as a convex programming problem in which an ob...
Wided Miled, Jean-Christophe Pesquet
CPAIOR
2007
Springer
14 years 3 months ago
A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems
In this paper we present a destructive lower bound for a number of resource constrained project scheduling (RCPS) problems, which is based on column generation. We first look at t...
J. M. van den Akker, Guido Diepen, J. A. Hoogeveen
ENDM
2010
81views more  ENDM 2010»
13 years 9 months ago
Mixed Integer NonLinear Programs featuring "On/Off" constraints: convex analysis and applications
We call "on/off" constraint an algebraic constraint that is activated if and only if
Hassan Hijazi, Pierre Bonami, Gérard Cornu&...
ICPP
2008
IEEE
14 years 3 months ago
Maotai: View-Oriented Parallel Programming on CMT Processors
View-Oriented Parallel Programming (VOPP) is a novel parallel programming model which uses views for commu
Jiaqi Zhang, Zhiyi Huang, Wenguang Chen, Qihang Hu...