Home Members Research Teaching Demos Software

---

 

	Research		Domain : 3D Learning Vision Constraint Prog. Sustain. Devel. Medical
	Projects Publications - by domain - by date - by author		Interval constraint programming [AAAI11] Inner Regions and Interval Linearization for Global Optimization [JFPC11] Régions intérieures et linéarisations par intervalles en optimisation globale [CP10] Making Adaptive an Interval Constraint Propagation Algorithm Exploiting Monotonicity [AAAI10] Exploiting Monotonicity in Interval Constraint Propagation [JFPC10a] Une nouvelle extension de fonctions aux intervalles basée sur le regroupement d'occurrences [JFPC10] Exploitation de la monotonie des fonctions dans la propagation de contraintes sur intervalles [IBB10] Improving inter-block backtracking with interval Newton [IJCAI07] Generalized interval projection : a new technique for consistent domain extension [INRIA5883] A specific quantifier elimination for inner box test in distance constraints with uncertainties [IJCGA06] Decomposition of geometric constraint systems : a survey [CP06] When interval analysis helps interblock backtracking [COCOS03] Inter-Block Backtracking: Exploiting the Structure in Continuous CSPs [IJCAI03] Algorithms for Identifying Rigid Subsystems in Geometric Constraint Systems [ADG02] A new structural rigidity for geometric constraints systems [GTMG02] De la rigidité structurelle [CP01] Links for Boosting Predictable Interactive Constraint Systems [JNPC00a] Résolution par contraintes de systèmes géométriques rigides [CP00] A Constraint Programming Approach for Solving Rigid Geometric Systems [CP98] Using Graph Decomposition for Solving Continuous CSPs Combinatorial optimization [TCS10] C-Strategy: A Dynamic Adaptive Strategy for the CLONALG Algorithm [CP03] INCOP: An Open Library for INcomplete Combinatorial OPtimization [CPAIOR03] When Local Search Goes with the Winners [ECAI02] Progressive Focusing Search [JNPC01] Méthodes de recherche arborescente comparées aux algorithmes génétiques sur des problèmes de coloriage de graphes surcontraints [MIC01] Tree Search Methods versus Genetic Algorithms for Over-Constrained Graph Coloring Problems [JNPC00b] Recherche à focalisation progressive [CP99] Ensuring a Relevant Visiting Order of the Leaf Nodes during a Tree Search [JNPC99] Etude théorique sur les recherches entrelacée et à divergence limitée [JNPC98] Recherche arborescente restreinte à un sous-espace prometteur [IJCAI97] Computational Complexity of Multi-way, Dataflow Constraint Problems [INRIA9786] Computational Complexity of Multi-way, Dataflow Constraint Problems [JNPC97] Parallélisation de la recherche arborescente des CSP avec distribution à profondeur variable [CNPC96] Distribution de l'arbre de recherche des problèmes de satisfaction de contraintes en domaines finis [INFORMS96] Houria III: Solver For Hierarchical Systems of Functional Constraints. Planningthe Solution Graph for a Weighted Sum Criterion [CP95] Houria II: A Solver For Hierarchical Systems, Planning of Lexicographic Satisfied Count Best Case Better Graph for Equational Constraints [EPIA95] A Non-Diffident Combinatorial Optimization Algorithm