no code implementations • 16 Jan 2014 • Lucas Bordeaux, George Katsirelos, Nina Narodytska, Moshe Y. Vardi
An important question is therefore whether strongly-polynomial algorithms exist that compute the common bound consistent fixpoint of a set of constraints.
no code implementations • 15 Jan 2014 • Lucas Bordeaux, Marco Cadoli, Toni Mancini
Literature on Constraint Satisfaction exhibits the definition of several structural properties that can be possessed by CSPs, like (in)consistency, substitutability or interchangeability.
no code implementations • 26 Feb 2019 • Nicolas Durrande, Vincent Adam, Lucas Bordeaux, Stefanos Eleftheriadis, James Hensman
Banded matrices can be used as precision matrices in several models including linear state-space models, some Gaussian processes, and Gaussian Markov random fields.