Sciweavers

189 search results - page 15 / 38
» From Linear Relaxations to Global Constraint Propagation
Sort
View
ANOR
2004
116views more  ANOR 2004»
13 years 7 months ago
Approximations and Randomization to Boost CSP Techniques
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
Carla P. Gomes, David B. Shmoys
ICASSP
2011
IEEE
12 years 11 months ago
A combined linear programming-maximum likelihood approach to radial velocity data analysis for extrasolar planet detection
In this paper we introduce a new technique for estimating the parameters of the Keplerian model commonly used in radial velocity data analysis for extrasolar planet detection. The...
Prabhu Babu, Petre Stoica
ICPR
2008
IEEE
14 years 8 months ago
Continuous graph cuts for prior-based object segmentation
In this paper we propose a novel prior-based variational object segmentation method in a global minimization framework which unifies image segmentation and image denoising. The id...
Anders Heyden, Christian Gosch, Christoph Schn&oum...
ENTCS
2008
115views more  ENTCS 2008»
13 years 7 months ago
Time Separation of Events: An Inverse Method
The problem of "time separation" can be stated as follows: Given a system made of several connected components, each one entailing a local delay known with uncertainty, ...
Emmanuelle Encrenaz, Laurent Fribourg
CP
2010
Springer
13 years 6 months ago
A Box-Consistency Contractor Based on Extremal Functions
Abstract. Interval-based methods can approximate all the real solutions of a system of equations and inequalities. The Box interval constraint propagation algorithm enforces Box co...
Gilles Trombettoni, Yves Papegay, Gilles Chabert, ...