-
Optimizing Compilation for Extensible Processors
Application specific instruction set processors (ASIP) are a well known compromise between the high performance of a dedicated hardware and the flexibility of a... -
New collaborative approaches for bin-packing problems
This document describes new models and methodologies that we apply to three families of packing problems. We first study decomposition methods and meta-heuristics... -
A Declarative Approach to Modeling and Solving the View Selection Problem
View selection is important in many data-intensive systems e.g., commercial database and data warehousing systems to improve query performance. View selection can be... -
A usage coverage based approach for assessing product family design
Adopting a utilitarian viewpoint of consumers on some service-oriented goods, we have first contributed to the proposal of a usage contexts model that a product should... -
Automata and Constraint Programming for Personnel Scheduling Problems
As soon as a structure is organized, the ability to put the right people at the right time is critical to satisfy the need of a department, a school or a company. We... -
Cumulative scheduling with overloads of resource : Global constraint and deco...
Constraint programming is an interesting approach to solve scheduling problems. In cumulative scheduling, activities are defined by their starting date, their duration... -
Metaheuristics for the guidance of a constraint solver dedicated to automated...
This thesis, led in collaboration with Sagem Defence & Security, focuses on defining an efficient search strategy to solve vehicle path planning problems. This... -
Global constraints and splitting strategies for solving continuous CSP
Distance constraints are widely used in many applications ranging from robotics to chemistry and CAD. Classical tehniques for solving such continuous constraints are... -
Scalable multi-dimensional resources scheduling constraints
Constraint programming is an approach often used to solve combinatorial problems in different application areas. In this thesis we focus on the cumulative scheduling... -
Coloriage de graphe en programmation par contraintes
National audience -
Allocation de créneaux de décollage sans conflit
National audience -
Constraint solver over floating-point numbers designed for program verification
The verification of programs with floating-point numbers computation is an important issue in the development of critical software systems. Computations over... -
Propagation garantie de contraintes ODE par morceaux pour l'optimisation globale
Prix du jeune chercheur -
Study of the Compilation of Contraint Logic Programming Languages over Finite...
This work focuses on the compilation of languages constraint logic programming over finite domains (DF) . Rather than taking the usual approach considering the... -
Une approche CSP pour l'aide à la localisation d'erreurs
10 pageshttp://jfpc-jiaf2014.univ-angers.fr/jfpc/ -
Branch-and-Infer: A Unifying Framework for Integer Linear Programming and Fin...
Colloque sur invitation. nationale. -
Branch-and-Infer: a Framework for Combining CP and IP
Contribution à un ouvrage.
