Variable neighborhood search for graphical model energy minimization
Graphical models factorize a global probability distribution/energy function as the
product/sum of local functions. A major inference task, known as MAP in Markov Random …
product/sum of local functions. A major inference task, known as MAP in Markov Random …
Valued constraint satisfaction problems
As an extension of constraint networks, valued constraint networks (or valued CSPs) define
a unifying framework for modelling optimisation problems over finite domains in which the …
a unifying framework for modelling optimisation problems over finite domains in which the …
Variable neighborhood search with cost function networks to solve large computational protein design problems
A Charpentier, D Mignon, S Barbe… - Journal of Chemical …, 2018 - ACS Publications
Computational protein design (CPD) aims to predict amino acid sequences that fold to
specific structures and perform desired functions. CPD depends on a rotamer library, an …
specific structures and perform desired functions. CPD depends on a rotamer library, an …
Iterative decomposition guided variable neighborhood search for graphical model energy minimization
Graphical models factorize a global probability distribution/energy function as the prod-
uct/sum of local functions. A major inference task, known as MAP in Markov Random Fields …
uct/sum of local functions. A major inference task, known as MAP in Markov Random Fields …