One popular and efficient scheme for solving combinatorial optimization problems over
graphical models exactly is depth-first Branch and Bound. However, when the algorithm …

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 …

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 …

In this paper, we address two key aspects of solving methods based on tree-decomposition.
First, we propose an algorithm computing decompositions that allows to bound the size of …

We present a parallel AND/OR Branch-and-Bound scheme that uses the power of a
computational grid to push the boundaries of feasibility for combinatorial optimization. Two …

In this paper we address efficient decentralised coordination of cooperative multi-agent
systems by taking into account the actual computation and communication capabilities of the …

In this thesis, we develop a Domain Specific Language (DSL) for a restricted class of
algorithms that can be naturally parallelized given their base description. In particular, this …

Abstract Solving a Partial Constraint Satisfaction Problem consists in assigning values to all
the variables of the problem such that a maximal subset of the constraints is satisfied. An …

We describe a distributed version of an advanced branch and bound algorithm over
graphical models. The crucial issue of load balancing is addressed by estimating …

Nous étudions dans cette thèse deux approches réduisant le temps de traitement
nécessaire pour résoudre des problèmes de planification et d'ordonnancement dans un …