A conservative scheme for parallel interval narrowing

DOI10.1016/S0020-0190(00)00048-XzbMATH Open1339.65252WikidataQ127482011 ScholiaQ127482011MaRDI QIDQ294755FDOQ294755

Authors: Laurent Granvilliers, Gaétan Hains 

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S002001900000048X?np=y

Recommendations

• scientific article; zbMATH DE number 802433
• scientific article; zbMATH DE number 1538006
• scientific article; zbMATH DE number 804625
• scientific article; zbMATH DE number 804651
• A class of problems that can be solved using interval algorithms

zbMATH Keywords

parallel algorithmsnumerical algorithmsBSP modelconstraint propagationinterval narrowing

Mathematics Subject Classification ID

Parallel numerical computation (65Y05)

Cites Work

• Consistency in networks of relations
• Heterogeneous constraint solving
• Numerical Solution of Nonlinear Equations
• Dynamic optimization of interval narrowing algorithms

Cited In (6)

• A class of problems that can be solved using interval algorithms
• A review of literature on parallel constraint solving
• A parallel algorithm for GAC filtering of the Alldifferent constraint
• Title not available (Why is that?)
• Parallelization method for a continuous property
• A reinforcement learning approach to interval constraint propagation

Uses Software

• BSPlib

This page was built for publication: A conservative scheme for parallel interval narrowing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294755)