Valued constraint satisfaction problems

MC Cooper, S de Givry, T Schiex - A Guided Tour of Artificial Intelligence …, 2020 - Springer
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 …

Parallel hybrid best-first search

A Beldjilali, P Montalbano, D Allouche… - … on Principles and …, 2022 - drops.dagstuhl.de
While processor frequency has stagnated over the past two decades, the number of
available cores in servers or clusters is still growing, offering the opportunity for significant …

Variable Neighborhood Search for Cost Function Networks

P Boizumault, S de Givry, S Loudni, A Ouali - Handbook of Formal …, 2024 - Springer
Abstract Cost Function Networks (CFNs) offer a simple and general framework for modeling
and solving constrained optimization problems which allows to deal with over-constrained …

Cost function networks to solve large computational protein design problems

D Allouche, S Barbe, S Givry, G Katsirelos… - … and Simulation in …, 2021 - Springer
Proteins are chains of simple molecules called amino acids. The sequence of amino acids in
the chain defines the three-dimensional shape of the protein and ultimately its biochemical …

[PDF][PDF] Parallel Hybrid Best-First Search for Cost Function Networks

A Beldjilali, D Allouche, S de Givry - … , CT, USA September 30–October 4 …, 2019 - miat.inrae.fr
Cost Function Networks (CFNs), also known as Weighted Constraint Satisfaction Problems
(Meseguer, Rossi, and Schiex 2006) is a mathematical model which has been derived from …

Méthodes exactes pour l'apprentissage de la structure d'un réseau bayésien et les réseaux de fonctions de coûts

F Trösser - 2022 - theses.hal.science
Les modèles graphiques discrets représentent des fonctions jointes sur de grands
ensembles de variables en tant qu'une combinaison de fonctions plus petites. Il existe …

Computation Protein Design instances with small tree-width: selection based on coarse approximated 3D average position volume

D Allouche - arXiv preprint arXiv:1909.01803, 2019 - arxiv.org
This paper proposes small tree-width graph decomposition computational protein design
CFN instances defined according to the model [1] with protocol defined by Simononcini et al …

[PDF][PDF] Heuristiques exploitant la relaxation linéaire pour l'optimisation dans les réseaux de fonction de coût

F Trösser, S de Givry… - Actes des 15es …, 2019 - imt-mines-albi.hal.science
Résumé Les solveurs exacts pour le problème d'optimisation dans les modèles graphiques,
comme par exemple les réseaux de fonctions de coût ou les champs aléatoires de Markov …