Accelerating filtering techniques for numeric CSPs
From MaRDI portal
Publication:1606118
DOI10.1016/S0004-3702(02)00194-7zbMath1015.68178OpenAlexW2079809152MaRDI QIDQ1606118
Publication date: 31 July 2002
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0004-3702(02)00194-7
interval analysisinterval arithmeticpropagationnonlinear equationspruningstrong consistencyextrapolation methodsacceleration methodsfiltering techniquesnumeric constraint satisfaction problem
Related Items
Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search, A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates, Arc-B-consistency of the inter-distance constraint, Solving linear, min and max constraint systems using CLP based on relational interval arithmetic, Single-machine scheduling with no idle time and release dates to~minimize a regular criterion, An Analysis of Slow Convergence in Interval Propagation, A reinforcement learning approach to interval constraint propagation, A rigorous global filtering algorithm for quadratic constraints, Scheduling a single machine to minimize a regular objective function under setup constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constraint propagation with interval labels
- Résultats négatifs en accélération de la convergence
- Constraint reasoning based on interval arithmetic: The tolerance propagation approach
- Consistency in networks of relations
- A constraint satisfaction approach to a circuit design problem
- Experiments using interval analysis for solving a circuit design problem
- Arc-consistency for continuous variables
- Extrapolation methods
- Rigorous global search: continuous problems
- Automatic generation of numerical redundancies for nonlinear constraint solving
- Computational complexity and feasibility of data processing and interval computations
- A simple derivation of the Hansen-Bliek-Rohn-Ning-Kearfott enclosure for linear interval equations
- A general extrapolation procedure revisited
- A derivation of extrapolation algorithms based on error estimates
- A sufficient condition for backtrack-bounded search
- Interval Methods for Systems of Equations
- Synthesizing constraint expressions
- Dynamic optimization of interval narrowing algorithms
- Solving Polynomial Systems Using a Branch and Prune Approach
- Applying interval arithmetic to real, integer, and boolean constraints
