Continuous and interval constraints
F Benhamou, L Granvilliers - Foundations of Artificial Intelligence, 2006 - Elsevier
Publisher Summary This chapter reviews that continuous constraint solving has been widely
studied in several fields of applied mathematics and computer science. In computer algebra …
studied in several fields of applied mathematics and computer science. In computer algebra …
[图书][B] Handbook of constraint programming
Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …
that draws on a wide range of techniques from artificial intelligence, computer science …
[图书][B] Interval Methods for Solving Nonlinear Constraint Satisfaction, Optimization and Similar Problems
BJ Kubica - 2019 - Springer
This book contains recent research on interval methods for solving nonlinear constraint
satisfaction, optimization and similar problems. It presents a comprehensive survey of …
satisfaction, optimization and similar problems. It presents a comprehensive survey of …
Interval computation and constraint propagation for the optimal design of a compression spring for a linear vehicle suspension system
H Trabelsi, PA Yvars, J Louati, M Haddar - Mechanism and Machine Theory, 2015 - Elsevier
In this paper an optimization design method based on existing intervals and constraint
satisfaction problem “CSP” computer tools is proposed. The method was used in the …
satisfaction problem “CSP” computer tools is proposed. The method was used in the …
[DOC][DOC] The Bernstein expansion and its applications
J Garloff - Journal of the American Romanian …, 2003 - www-home.htwg-konstanz.de
This tutorial article gives an introduction into the expansion of a multivariate polynomial into
Bernstein polynomials and the use of this expansion for finding tight bounds for the range of …
Bernstein polynomials and the use of this expansion for finding tight bounds for the range of …
Exploiting common subexpressions in numerical CSPs
It is acknowledged that the symbolic form of the equations is crucial for interval-based
solving techniques to efficiently handle systems of equations over the reals. However, only a …
solving techniques to efficiently handle systems of equations over the reals. However, only a …
A component-based parallel constraint solver
P Zoeteweij, F Arbab - … , COORDINATION 2004 Pisa Italy, February 24-27 …, 2004 - Springer
As a case study that illustrates our view on coordination and component-based software
engineering, we present the design and implementation of a parallel constraint solver. The …
engineering, we present the design and implementation of a parallel constraint solver. The …
Novel approaches to numerical software with result verification
L Granvilliers, V Kreinovich, N Müller - Numerical Software with Result …, 2004 - Springer
Traditional design of numerical software with result verification is based on the assumption
that we know the algorithm f (x 1,..., xn) that transforms inputs x 1,..., xn into the output y= f (x …
that we know the algorithm f (x 1,..., xn) that transforms inputs x 1,..., xn into the output y= f (x …
[PDF][PDF] Stress concentration factors: determination of ranges of values by the method of quantifier elimination
N Ioakimidis - 2018 - researchgate.net
The interesting and modern method of quantifier elimination in computer algebra was
already applied to a very large number of problems including, eg, ranges of functions and …
already applied to a very large number of problems including, eg, ranges of functions and …