Propagation by Selective Initialization and Its Application to Numerical Constraint Satisfaction Problems

Details Propagation by Selective Initialization and Its Application to Numerical Constraint Satisfaction Problems Propagation by Selective Initialization and Its Application to Numerical Constraint Satisfaction Problems

2004-04-16

arxiv.org/abs/cs/0404034v1

Computer Science

Numerical Analysis

Scientific paper

Numerical analysis has no satisfactory method for the more realistic optimization models. However, with constraint programming one can compute a cover for the solution set to arbitrarily close approximation. Because the use of constraint propagation for composite arithmetic expressions is computationally expensive, consistency is computed with interval arithmetic. In this paper we present theorems that support, selective initialization, a simple modification of constraint propagation that allows composite arithmetic expressions to be handled efficiently.

Affiliated with

Also associated with

No associations

Rating

Propagation by Selective Initialization and Its Application to Numerical Constraint Satisfaction Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Propagation by Selective Initialization and Its Application to Numerical Constraint Satisfaction Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Propagation by Selective Initialization and Its Application to Numerical Constraint Satisfaction Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-400145