Search the dblp DataBase
Christophe Jermann :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Christophe Jermann , Bertrand Neveu , Gilles Trombettoni A New Structural Rigidity for Geometric Constraint Systems. [Citation Graph (0, 0)][DBLP ] Automated Deduction in Geometry, 2002, pp:87-106 [Conf ] Bertrand Neveu , Christophe Jermann , Gilles Trombettoni Inter-block Backtracking: Exploiting the Structure in Continuous CSPs. [Citation Graph (0, 0)][DBLP ] COCOS, 2003, pp:15-30 [Conf ] Christophe Jermann , Gilles Trombettoni , Bertrand Neveu , Michel Rueher A Constraint Programming Approach for Solving Rigid Geometric Systems. [Citation Graph (0, 0)][DBLP ] CP, 2000, pp:233-248 [Conf ] Frédéric Goualard , Christophe Jermann On the Selection of a Transversal to Solve Nonlinear Systems with Interval Arithmetic. [Citation Graph (0, 0)][DBLP ] International Conference on Computational Science (1), 2006, pp:332-339 [Conf ] Marta Wilczkowiak , Gilles Trombettoni , Christophe Jermann , Peter F. Sturm , Edmond Boyer Scene Modeling Based on Constraint System Decomposition Techniques. [Citation Graph (0, 0)][DBLP ] ICCV, 2003, pp:1004-1010 [Conf ] Christophe Jermann , Bertrand Neveu , Gilles Trombettoni Algorithms for Identifying Rigid Subsystems in Geometric Constraint Systems. [Citation Graph (0, 0)][DBLP ] IJCAI, 2003, pp:233-238 [Conf ] Christophe Jermann , Gilles Trombettoni , Bertrand Neveu , Pascal Mathis Decomposition of Geometric Constraint Systems: a Survey. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 2006, v:16, n:5-6, pp:379-414 [Journal ] Search Strategies for an Anytime Usage of the Branch and Prune Algorithm. [Citation Graph (, )][DBLP ] A constraint hierarchies approach to geometric constraints on sketches. [Citation Graph (, )][DBLP ] Splitting heuristics for disjunctive numerical constraints. [Citation Graph (, )][DBLP ] A Reinforcement Learning Approach to Interval Constraint Propagation. [Citation Graph (, )][DBLP ] Search in 0.001secs, Finished in 0.002secs