[HTML][HTML] Preferences in AI: An overview

C Domshlak, E Hüllermeier, S Kaci, H Prade - Artificial Intelligence, 2011 - Elsevier
This editorial of the special issue “Representing, Processing, and Learning Preferences:
Theoretical and Practical Challenges” surveys past and ongoing research on preferences in …

Models and solution techniques for frequency assignment problems

KI Aardal, SPM Van Hoesel, AMCA Koster… - Annals of Operations …, 2007 - Springer
Wireless communication is used in many different situations such as mobile telephony, radio
and TV broadcasting, satellite communication, wireless LANs, and military operations. In …

Soft arc consistency revisited

MC Cooper, S De Givry, M Sánchez, T Schiex… - Artificial Intelligence, 2010 - Elsevier
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem
defined by a network of local cost functions defined over discrete variables. It has …

Multi-language evaluation of exact solvers in graphical model discrete optimization

B Hurley, B O'sullivan, D Allouche, G Katsirelos… - Constraints, 2016 - Springer
By representing the constraints and objective function in factorized form, graphical models
can concisely define various NP-hard optimization problems. They are therefore extensively …

[HTML][HTML] Computational protein design as an optimization problem

D Allouche, I André, S Barbe, J Davies, S de Givry… - Artificial Intelligence, 2014 - Elsevier
Proteins are chains of simple molecules called amino acids. The three-dimensional shape of
a protein and its amino acid composition define its biological function. Over millions of years …

Happy mood decreases self‐focused attention

JD Green, C Sedikides, JA Saltzberg… - British Journal of …, 2003 - Wiley Online Library
Research addressing the influence of happy mood on self‐focused attention has yielded
inconsistent results. Some studies found that happy mood decreased self‐focus relative to …

High-arity interactions, polyhedral relaxations, and cutting plane algorithm for soft constraint optimisation (MAP-MRF)

T Werner - 2008 IEEE Conference on Computer Vision and …, 2008 - ieeexplore.ieee.org
LP relaxation approach to soft constraint optimisation (ie MAP-MRF) has been mostly
considered only for binary problems. We present its generalisation to n-ary problems …

[PDF][PDF] Virtual Arc Consistency for Weighted CSP.

MC Cooper, S De Givry, M Sánchez-Fibla, T Schiex… - AAAI, 2008 - cdn.aaai.org
Optimizing a combination of local cost functions on discrete variables is a central problem in
many formalisms such as in probabilistic networks, maximum satisfiability, weighted CSP or …

Graphical models: queries, complexity, algorithms

M Cooper, S de Givry, T Schiex - Leibniz International Proceedings in …, 2020 - hal.science
Graphical models (GMs) define a family of mathematical models aimed at the concise
description of multivariate functions using decomposability. We restrict ourselves to functions …

Mendelian error detection in complex pedigrees using weighted constraint satisfaction techniques

M Sanchez, S de Givry, T Schiex - Constraints, 2008 - Springer
With the arrival of high throughput genotyping techniques, the detection of likely genotyping
errors is becoming an increasingly important problem. In this paper we are interested in …