-
Algorithmic Solutions for Several Time- and Resource-Constrained Job Scheduli...
The ideas for some of the algorithms presented in this paper were developed in the following contexts: - the first author was the coach of the ACM ICPC team of the second author... -
Simulation of the Opening and Closing of Hsp70 Chaperones by Coarse-Grained M...
International audience -
Geometric Optimal Control of Simple Quantum Systems
International audience -
Architecture Engineering for a trans-generation evolution towards NGNs: Verti...
The network domain, in the heart of the information and communication technologies, has been distinguished, the last few years, by the growth the users demand, coupled... -
Comparison of solutions to the multi-country real business cycle model
International audience -
An efficient CPU-GPU implementation of the multiple absorption coefficient zo...
International audience -
Algorithms for the universal decomposition algebra
Let k be a field and let f be a polynomial of degree n in k [T]. The symmetric relations are the polynomials in k [X1, ..., Xn] that vanish on all permutations of the... -
Is it possible to find the maximum clique in general graphs?
Finding the maximum clique is a known NP-Complete problem and it is also hard to approximate. This work proposes two efficient algorithms to obtain it. Nevertheless,... -
Contributions to algebraic system solving: reduction, localization, singulari...
This PhD thesis deals with some particular aspects of the algebraic systems resolution. Firstly, we introduce a way of minimizing the number of additive variables... -
Approximation Algorithms with Low Memory Capacities for Large Graphs Processi...
We are interested to an optimization problem on graphs (the Vertex Cover) in a very specific context: the huge instances of data. We defined a treatment model based on... -
On Randomness in Hash Functions
International audience -
Playing Mastermind With Constant-Size Memory
International audience -
Yeast ancestral genome reconstructions: the possibilities of computational me...
International audience -
Memory optimization strategies for linear mappings and indexation-based share...
This thesis aims at developing strategies to enhance the power of sequential computation and distributed systems, particularly, it deals with sequential break down of... -
Minimal Forbidden Words and Applications
Version révisée après soutenance -
Extensions of the witness method to characterize under-, over- and well-const...
International audience -
A formalization of geometric constraint systems and their decomposition
International audience -
A particle-spring approach to geometric constraints solving
International audience -
Using the witness method to detect rigid subsystems of geometric constraints ...
International audience
