-
Some applications of linear programming formulations in stochastic control
International audience -
Affine Data-Flow Graphs for the Synthesis of Hard Real-Time Applications
International audience -
Computation of polytopic invariants for polynomial dynamical systems using li...
International audience -
Iterative Methods in Combinatorial Optimization
International audience -
Adapting algorithms to parallel architectures
In this thesis, we are interested in adapting algorithms to parallel architectures. Current high performance platforms have several levels of parallelism and require a... -
Implementation of Lipsol in Scilab
Projet META2 -
Complete Solving of Linear Diophantine Equational and Inequational Systems wi...
In this report, we present an algorithm for solving {\em directly} linear Diophantine systems of both equations and inequations. Here directly means without adding... -
Minimizing the stretch when scheduling flows of biological requests
In this paper, we consider the problem of scheduling comparisons of motifs against biological databanks. This problem lies in the divisible load framework with... -
WDM Mesh Networks with Dynamic Traffic
This article presents a mathematical model that results in a low-cost network design to satisfy a set of point-to-point demands that arrive and leave the network along... -
Linear programming problems for $L_1$ optimal frontier estimation
We propose new optimal estimators for the Lipschitz frontier of a set of points. They are defined as kernel estimators being sufficiently regular, covering all the... -
Feature-Preserving Surface Reconstruction and Simplification from Defect-Lade...
We propose a robust, feature-preserving surface reconstruction algorithm which turns a point set with noise and outliers into a low triangle-count simplicial complex.... -
Line configuration to minimize setup costs
International audience -
Network Calculus Algoritmics
Network Calculus is a theory aiming at computing worst-case bounds on performances in communication networks. The network is usually modelled by a digraph : the... -
Planification réactive et robuste au sein d'une chaîne logistique
This work focuses on the supply chain tactical planning problem in an uncertain and disrupted environment. As part of point-to-point relationships, we propose an... -
Minimizing the Stretch When Scheduling Flows of Biological Requests
International audience -
Efficient Robust Digital Hyperplane Fitting with Bounded Error
International audience -
Discontinuous control problems with state constraints : Linear formulations a...
International audience -
Stable dimensioning issue for optical packet ring with uniform and symmetric ...
International audience -
Linear programming formulations for queueing control problems with action dec...
We consider a special class of continuous-time Markov decision processes (CTMDP) that are action decomposable. An action-Decomposed CTMDP (D-CTMPD) typically models...
