Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

CP
2005
Springer

favoriteEmaildiscussreport

88views Artificial Intelligence» more CP 2005»

Using Constraint Programming for Solving Distance CSP with Uncertainty

13 years 10 months ago

Using Constraint Programming for Solving Distance CSP with Uncertainty

Download www-sop.inria.fr

Many problems in chemistry, robotics or molecular biology can be expressed as a Distance CSP4 . In this paper, we propose a speciﬁc methodology for tackling uncertainties in this class of problems. The main idea consists in solving the CSP without taking into account the uncertainties and using this information to approximate the solution space of the original CSP. This methodology permits to obtain an interior and exterior approximation of each solution sub-space by a set of disjoint boxes.

Carlos Grandón, Bertrand Neveu

Real-time Traffic

CP 2005 | Many Problems | Original Csp | Programming Languages | Speciﬁc Methodology |

claim paper

Related Content

» Solving MaxSAT as Weighted CSP

» A BottomUp Approach for Solving Quantified CSPs

» Effective Modeling with Constraints

» A Synthesis of Constraint Satisfaction and Constraint Solving

» Exploiting Problem Structure for Solution Counting

» Distributed localization using noisy distance and angle information

» Automatically Exploiting Symmetries in Constraint Programming

» Chance constrained programming approach to process optimization under uncertainty

» The multi variable multi constrained distributed constraint optimization framework

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	CP
Authors	Carlos Grandón, Bertrand Neveu

Comments (0)