Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
This paper describes a novel numerical model aiming at solving moving-boundary problems such as free-surface flows or fluid– structure interaction. This model uses a moving-gr...
Nicolas Bodard, Roland Bouffanais, Michel O. Devil...
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
The steady state of the quasilinear convection-diffusion-reaction equation ut − (D(u) u) + b(u) u + c(u) = 0 (1) is studied. Depending on the ratio between convection and diff...
Abstract. Methods exploiting problem symmetries have been very successful in several areas including constraint programming and SAT solving. We here recast a technique to enhance t...