| |
|
Journals
- [IBB10] Neveu, B. and Trombettoni, G .and Chabert, G. Improving inter-block backtracking with interval Newton . Constraints Journal, 15(1), p93-116 , 2010. (.bib)
- [TCS10] Riff, M.-C. and Montero, E. and Neveu, B. C-Strategy: A Dynamic Adaptive Strategy for the CLONALG Algorithm . Transactions on Computational Science, 8, p41-55 , 2010. (.bib)
- [IJCGA06] Jermann, C. and Trombettoni, G. and Neveu, B. and Mathis, P. Decomposition of geometric constraint systems : a survey . International journal of computational geometry and applications, 2006. (.bib)
Top Rank Conferences (CVPR, ICCV, ECCV, ICML, COLT, NIPS, IPMI, MICCAI, AAAI, IJCAI)
- [AAAI11] Trombettoni, G. and Araya, I. and Neveu, B. and Chabert, G. Inner Regions and Interval Linearization for Global Optimization. Proceedings of the twenty-fifth AAAI on Artificial Intelligence, San Francisco, Aug 2011. (.bib)
- [AAAI10] Araya, I. and Trombettoni, G. and Neveu, B. Exploiting Monotonicity in Interval Constraint Propagation . The Twenty-Fourth AAAI Conference on Artificial Intelligence, p 9-14, Atlanta, USA, Jul 2010. (.bib)
- [IJCAI07] Grandon, C. and Chabert, G. and Neveu, B. Generalized interval projection : a new technique for consistent domain extension. IJCAI, 2007. (.bib)
- [IJCAI03] Jermann, C and Neveu, B and Trombettoni, G Algorithms for Identifying Rigid Subsystems in Geometric Constraint Systems. Int Joint Conference on Artificial Intelligence, Acapulco, 2003. (.bib)
- [IJCAI97] Trombettoni, G. and Neveu, B. Computational Complexity of Multi-way, Dataflow Constraint Problems. IJCAI, Nagoya, Aug 1997. (.bib)
Conferences
- [JFPC11] Trombettoni, G. and Araya, I. and Neveu, B. and Chabert, G. Régions intérieures et linéarisations par intervalles en optimisation globale. Journées Francophones de Programmation par Contraintes, p299-306, Lyon, Jun 2011. (.bib)
- [CP10] Araya, I. and Trombettoni, G. and Neveu, B. Making Adaptive an Interval Constraint Propagation Algorithm Exploiting Monotonicity . The International Conference on Principles and Practice of Constraint Programming, p61-68, St Andrews - Ecosse, Sep 2010. (.bib)
- [JFPC10a] Araya, I. and Neveu, B. and Trombettoni, G. Une nouvelle extension de fonctions aux intervalles basée sur le regroupement d'occurrences . Journées Francophones de Programmation par Contraintes, p13-22, Caen , Jun 2010. (.bib)
- [JFPC10] Araya, I. and Trombettoni, G. and Neveu, B. Exploitation de la monotonie des fonctions dans la propagation de contraintes sur intervalles . Journées Francophones de Programmation par Contraintes, p23-32, Caen , Jun 2010. (.bib)
- [CP06] Neveu, B. and Chabert, G. and Trombettoni, G. When interval analysis helps interblock backtracking. 12th international conference on principles and pratice of constraint programming, 2006. (.bib)
- [COCOS03] Jermann, C and Neveu, B and Trombettoni, G Inter-Block Backtracking: Exploiting the Structure in Continuous CSPs. 2nd International Workshop on Global Constrained Optimization and Constraint Satisfaction, Lausanne, 2003. (.bib)
- [CP03] Neveu, B and Trombettoni, G INCOP: An Open Library for INcomplete Combinatorial OPtimization. Principles and Practice of Constraint Programming, Cork, 2003. (.bib)
- [CPAIOR03] Neveu, B and Trombettoni, G When Local Search Goes with the Winners. 5th Int. Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimisation Problems, Montreal, 2003. (.bib)
- [JNPC03a] Neveu, B and Trombettoni, G Hybridation de GWW avec de la recherche locale. 9e Journées Nationales sur la résolution pratique de Problèmes NP-Complets, Amiens, 2003. (.bib)
- [JNPC03b] Jermann, C and Neveu, B and Trombettoni, G Algorithmes pour la détection de rigidités dans les CSP géométriques. 9e Journées Nationales sur la résolution pratique de Problèmes NP-Complets, Amiens, 2003. (.bib)
- [ADG02] Jermann, C and Neveu, B and Trombettoni, G A new structural rigidity for geometric constraints systems. Fourth International Workshop on Automated Deduction in Geometry, Linz, 2002. (.bib)
- [ECAI02] Prcovic, N and Neveu, B Progressive Focusing Search. 15th European Conference on Artificial Intelligence, Lyon, 2002. (.bib)
- [GTMG02] Jermann, C and Neveu, B and Trombettoni, G De la rigidité structurelle. Groupe de travail en modélisation géométrique, Nantes, 2002. (.bib)
- [CP01] Trombettoni, G and Neveu, B Links for Boosting Predictable Interactive Constraint Systems. International Workshop on User Interaction in Constraint Satisfaction, Chypre, 2001. (.bib)
- [JNPC01] Madeline, B and Neveu, B Méthodes de recherche arborescente comparées aux algorithmes génétiques sur des problèmes de coloriage de graphes surcontraints. 7e Journées Nationales sur la résolution pratique de Problèmes NP-Complets, Toulouse, 2001. (.bib)
- [MIC01] Madeline, B and Neveu, B Tree Search Methods versus Genetic Algorithms for Over-Constrained Graph Coloring Problems. Metaheuristics International Conference, Porto, 2001. (.bib)
- [JNPC00a] Jermann, C. and Trombettoni, G. and Neveu, B. and Rueher, M. Résolution par contraintes de systèmes géométriques rigides. VI Journées Nationales sur les Problèmes NP-Complets, Marseille, Jun 2000. (.bib)
- [JNPC00b] Prcovic, N. and Neveu, B. Recherche à focalisation progressive. VI Journées Nationales sur les Problèmes NP-Complets, Marseille, Jun 2000. (.bib)
- [CP00] Jermann, C. and Trombettoni, G. and Neveu, B. and Rueher, M. A Constraint Programming Approach for Solving Rigid Geometric Systems. Constraint Programming, Singapore, 2000. (.bib)
- [CP99] Prcovic, N. and Neveu, B. Ensuring a Relevant Visiting Order of the Leaf Nodes during a Tree Search. Principles and Practice of Constraint Programming, Alexandria, Oct 1999. (.bib)
- [JNPC99] Prcovic, N. and Neveu, B. Etude théorique sur les recherches entrelacée et à divergence limitée. Ve Journées Nationales sur les Problèmes NP-Complets, Lyon, Jun 1999. (.bib)
- [JNPC98] Prcovic, N. and Neveu, B. Recherche arborescente restreinte à un sous-espace prometteur. IVe Journées Nationales sur les Problèmes NP-Complets, Nantes, May 1998. (.bib)
- [CP98] Bliek, C. and Neveu, B. and Trombettoni, G. Using Graph Decomposition for Solving Continuous CSPs. Principles and Practice of Constraint Programming, 1998. (.bib)
- [JNPC97] Prcovic, N and Neveu, B Parallélisation de la recherche arborescente des CSP avec distribution à profondeur variable. IIIe Journées Nationales sur les Problèmes NP-Complets, Rennes, 1997. (.bib)
- [CNPC96] Prcovic, N. and Neveu, B. and Berlandier, P. Distribution de l'arbre de recherche des problèmes de satisfaction de contraintes en domaines finis. 2ème Conférence Nationale sur la Résolution de Problèmes NP-Complets, 1996. (.bib)
- [INFORMS96] Bouzoubaa, M. and Neveu, B. and Hasle, G Houria III: Solver For Hierarchical Systems of Functional Constraints. Planningthe Solution Graph for a Weighted Sum Criterion. Fifth INFORMS Conference on Computer Science and Operations Research, 1996. (.bib)
- [CP95] Bouzoubaa, M. and Neveu, B. and Hasle, G Houria II: A Solver For Hierarchical Systems, Planning of Lexicographic Satisfied Count Best Case Better Graph for Equational Constraints. Workshop on Constraints for Graphics and Visualization, 1995. (.bib)
- [EPIA95] Trombettoni, G. and Neveu, B. and Berlandier, P. and Riff Rojas, M-C. and Bouzoubaa, M. A Non-Diffident Combinatorial Optimization Algorithm. Workshop on Studying and Solving Really Hard Problems, 1995. (.bib)
- [PPAI95] Berlandier, P. and Neveu, B. Problem Partition and Solvers Coordination in Distributed Constraint Satisfaction. Workshop Parallel Processing in Artificial Intelligence, 1995. (.bib)
- [ECAI94] Neveu, B. and Berlandier, P. Arc-Consistency for Dynamic Constraint Problems: An RMS-free Approach. Workshop on Constraint Satisfaction Issues Raised by Practical Applications, 1994. (.bib)
- [TAI94] Neveu, B. and Berlandier, P. Maintaining Arc Consistency through Constraint Retraction. TAI, 1994. (.bib)
Research Reports
- [INRIA5883] Grandon, C. and Neveu, B. A specific quantifier elimination for inner box test in distance constraints with uncertainties . INRIA 5883, Apr 2006. (.bib)
- [INRIA9786] Trombettoni, G. and Neveu, B. Computational Complexity of Multi-way, Dataflow Constraint Problems. INRIA 9786, 1997. (.bib)
|
