Enforcing box consistency---or a variation thereof---is an efficient means to reliably solve nonlinear continuous constraint systems. We present a new algorithm to enforce box consistency that is simpler than the classical one, faster, and easily data parallelizable. A prototype parallel implementation with SIMD SSE instructions shows that speed-ups of 60\% up to an order of magnitude and more are achievable
International audienceInterval-based methods can approximate all the real solutions of a system of e...
In this paper we discuss parallelization and distribution of problems modeled in a constraint progra...
In Constraint Processing, many algorithms for enforcing the same level of local consistency may exis...
Numerical methods based on interval arithmetic are efficient means to reliably solve nonlinear syste...
10 pagesInternational audienceNumerical methods based on interval arithmetic are efficient means to ...
Interval constraint solvers use local consistencies—among which one worth mentioning is box consiste...
Program parallelization becomes increasingly important when new multi-core architectures provide way...
Program parallelization becomes increasingly important when new multi-core architectures provide way...
This paper discusses how better arc consistency algorithms for constraint satisfaction can be develo...
Writing efficient parallel programs is the biggest challenge of the software industry for the forese...
AbstractThis paper is an introduction to Newton, a constraint programming language over nonlinear re...
A parallel implementation of constraint satisfac-tion by arc consistency is presented. The im-plemen...
AbstractWith the advent of cost-effective massively parallel computers, researchers conjecture that ...
A general-purpose constraint satisfaction algorithm has been developed as part of the FLITE system f...
Interval-based solving techniques use different operators to compute, in a reliable way, the real so...
International audienceInterval-based methods can approximate all the real solutions of a system of e...
In this paper we discuss parallelization and distribution of problems modeled in a constraint progra...
In Constraint Processing, many algorithms for enforcing the same level of local consistency may exis...
Numerical methods based on interval arithmetic are efficient means to reliably solve nonlinear syste...
10 pagesInternational audienceNumerical methods based on interval arithmetic are efficient means to ...
Interval constraint solvers use local consistencies—among which one worth mentioning is box consiste...
Program parallelization becomes increasingly important when new multi-core architectures provide way...
Program parallelization becomes increasingly important when new multi-core architectures provide way...
This paper discusses how better arc consistency algorithms for constraint satisfaction can be develo...
Writing efficient parallel programs is the biggest challenge of the software industry for the forese...
AbstractThis paper is an introduction to Newton, a constraint programming language over nonlinear re...
A parallel implementation of constraint satisfac-tion by arc consistency is presented. The im-plemen...
AbstractWith the advent of cost-effective massively parallel computers, researchers conjecture that ...
A general-purpose constraint satisfaction algorithm has been developed as part of the FLITE system f...
Interval-based solving techniques use different operators to compute, in a reliable way, the real so...
International audienceInterval-based methods can approximate all the real solutions of a system of e...
In this paper we discuss parallelization and distribution of problems modeled in a constraint progra...
In Constraint Processing, many algorithms for enforcing the same level of local consistency may exis...