… These algorithms take advantage of compact set representations (eg, ellipsoids and
zonotopes) and/or in general the convexity of all constraints.Their computational complexity is …

… a zonotope, whose vertices give all possible rankings on V which can be induced by a linear
scoring scheme. Zonotopes … Our aim in this section is to generalize zonotopes to the case …

Hybrid systems exhibit all the complexities of finite automata, nonlinear dynamic systems
and differential equations, and are extremely difficult to analyze. A rigorous mathematical …

In this chapter, we expand on the construction of an IFS with probability (as seen in Sect. 2.5
in Chapter 2). We do this in many different directions, but all with the same overall scheme …

This paper is concerned with improvements in constraints handling for mixed-integer
optimization problems. The novel element is the reduction of the number of binary variables used …

Ch ll P bl Challenge Problems Scale model checking algorithms to handle unmodified
industrial size software as used for safety critical embedded systems (aerospace/automotive/…

… Unimodular oriented matroids are in bijection with mixed subdivisions of a zonotope, where
any edge used in the summand is an edge of ∆d−1. There happens to be a natural class of …

Cette thèse traite du problème d'observation et d'estimation des variables caractéristiques
des systèmes dynamiques. Il s’ agit d’une problématique fondamentale qui est au cœur de …

The aim of this thesis is to develop some possible generalizations of the Brill-Noether theory
of smooth curves, to singular curves and to tropical curves. We briefly summarize the …

… Lindenstrauss, “Distribution of points on sphere and approximation by zonotopes,” Isr. J.
Math.… Lindenstrauss, and VD Milman, “Approximation of zonoids by zonotopes,” Acta Math., 162, …