On cherche dans cette thèse à caractériser un domaine de confiance pour la localisation d'un
véhicule, en utilisant des méthodes ensemblistes robustes par intervalles. La localisation …

In this paper we show that there is no local equatorial characterization of zonoids in odd
dimensions. This gives a negative answer to the conjecture posed by W. Weil in 1977 and …

This volume contains the proceedings of the 22nd International Conference on Computer-Aided
Verification (CAV) held in Edinburgh, UK, July 15–19 2010. CAV is dedicated to the …

We investigate in this paper the duality gap between quadratic knapsack problem and its
Lagrangian dual or semidefinite programming relaxation. We characterize the duality gap by a …

Gioan showed that the number of cycle reversing classes of totally cyclic orientations of a
given graph can be calculated as an evaluation of the corresponding Tutte polynomial. We …

This international conference was organized by Toshiyuki Kobayashi (University of Tokyo),
Bernhard Kr\" otz (MPIM Bonn), Erez Lapid (Hebrew University) and Charles Torossian (Paris …

De nombreux outils existent pour résoudre les problèmes de planification sous contraintes.
On peut les regrouper en deux classes principales. Les plus anciens planificateurs utilisent …

The chromatic polynomial of a graph is a one-variable polynomial that counts the number of
ways the vertices of a graph can be properly colored. It was invented in 1912 by GD Birkhoff …

In the context of integer programming, we develop a polyhedral method for linearizing a
product of a pair of real linear functions in 0/1 variables. As an example, by writing a pair of …

In the engineering sciences, observation uncertainty often consists of two main types:
random variability due to uncontrollable external effects, and imprecision due to remaining …