Search the dblp DataBase

Publications of Author

1. Claude Michel
   Exact Projection Functions for Floating Point Number Constraints (pdf). [Citation Graph (0, 0)][DBLP]
   AMAI, 2002, pp:- [Conf]
   
2. Yahia Lebbah, Claude Michel, Michel Rueher
   Efficient Pruning Technique Based on Linear Relaxations. [Citation Graph (0, 0)][DBLP]
   COCOS, 2003, pp:1-14 [Conf]
   
3. Heikel Batnini, Claude Michel, Michel Rueher
   Mind the Gaps: A New Splitting Strategy for Consistency Techniques. [Citation Graph (0, 0)][DBLP]
   CP, 2005, pp:77-91 [Conf]
   
4. Yahia Lebbah, Michel Rueher, Claude Michel
   A Global Filtering Algorithm for Handling Systems of Quadratic Equations and Inequations. [Citation Graph (0, 0)][DBLP]
   CP, 2002, pp:109-123 [Conf]
   
5. Claude Michel, Michel Rueher, Yahia Lebbah
   Solving Constraints over Floating-Point Numbers. [Citation Graph (0, 0)][DBLP]
   CP, 2001, pp:524-538 [Conf]
   
6. Yahia Lebbah, Claude Michel, Michel Rueher
   Using constraint techniques for a safe and fast implementation of optimality-based reduction. [Citation Graph (0, 0)][DBLP]
   SAC, 2007, pp:326-331 [Conf]
   
7. Yahia Lebbah, Claude Michel, Michel Rueher
   A Rigorous Global Filtering Algorithm for Quadratic Constraints*. [Citation Graph (0, 0)][DBLP]
   Constraints, 2005, v:10, n:1, pp:47-65 [Journal]
   
8. Bernard Botella, Arnaud Gotlieb, Claude Michel
   Symbolic execution of floating-point computations. [Citation Graph (0, 0)][DBLP]
   Softw. Test., Verif. Reliab., 2006, v:16, n:2, pp:97-121 [Journal]
   
9. Bernard Botella, Arnaud Gotlieb, Claude Michel, Michel Rueher, Patrick Taillibert
   Utilisation des contraintes pour la génération automatique de cas de test structurels. [Citation Graph (0, 0)][DBLP]
   Technique et Science Informatiques, 2002, v:21, n:9, pp:1163-1187 [Journal]
   
10. 
    Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm. [Citation Graph (, )][DBLP]
    
    
11. 
    An efficient algorithm for a sharp approximation of universally quantified inequalities. [Citation Graph (, )][DBLP]
    
    
12. 
    Efficient handling of universally quantified inequalities. [Citation Graph (, )][DBLP]
    
    
13. 
    An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities [Citation Graph (, )][DBLP]
    
    
14. 
    Revisiting the upper bounding process in a safe Branch and Bound algorithm [Citation Graph (, )][DBLP]
    
    
15. 
    Handling software upgradeability problems with MILP solvers [Citation Graph (, )][DBLP]