-
Complexity Estimates for Two Uncoupling Algorithms
International audience -
A quadratic bound for the determinant and permanent problem.
International audience -
Homotopy techniques for multiplication modulo triangular sets
International audience -
The lexicographic α-robust knapsack problem
International audience -
The single item uncapacitated lot-sizing problem with time-dependent batch si...
International audience -
Anharmonicities of vibrational motion in even-even deformed nuclei
If we consider the history of science as a whole, we find that the great advances and the great scientific theories until the 18th century were produced by universal... -
Contribution to the Formalization of Individualized Processes during Product ...
International audience -
Self-service bike sharing systems: simulation, repositioning, pricing
Self-service bike sharing systems experience often imbalance problems: in some stations there is a lack of bikes while in others there are too many bikes, leaving no... -
Modular Composition Modulo Triangular Sets and Applications
International audience -
On the complexity of Submap Isomorphism
International audience -
The vertex-colouring {a,b}-edge-weighting problem is NP-complete for every pa...
Let G be a graph. From an edge-weighting w : E(G) -> {a,b} of G such that a and b are two distinct real numbers, one obtains a vertex-colouring chi_w of G defined... -
Biomaterials porosity determined by fractal dimensions, succolarity and lacun...
International audience -
Zero-nonzero and real-nonreal sign determination
International audience -
An interval assignment problem for resource optimization in LTE networks
International audience -
Designing expressive interaction techniques for novices inspired by expert ac...
As interactive systems are now used to perform a variety of complex tasks, users need systems that are at the same time expressive, efficient and usable. Although... -
A rigourous mathematical framework for computing a sustainability ratio: The ...
cited By (since 1996)0 -
Fast arithmetics in Artin-Schreier towers over finite fields
International audience -
Phase semantics, proof nets and some decision problems in linear logic.
Linear logic (LL) is very expressive: the smallest propositonal fragment is already NP-complete and the whole logic is indecidable. One can simulate usual... -
Time-salving algorithms for vehicule routing and scheduling problems
In this thesis, we deal with modeling and solving various problems including vehicle routing and scheduling. We propose approximate methods that aim to solve problems...
