Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Ndiaye, Samba Ndojh - Département Informatique, UFR Faculté des Sciences et Technologies, Université Claude Bernard (Lyon I)
A new Evaluation of Forward Checking and its Consequences on Efficiency of Tools for Decomposition of CSPs
Heuristiques pour la recherche numrative borne : Vers une libration de l'ordre
Dynamic heuristics for branch and bound search on tree-decomposition of Weighted CSPs
Computing and exploiting tree-decompositions for solving constraint networks
Computing and exploiting tree-decompositions for (Max-)CSP Philippe Jegou, Samba Ndojh Ndiaye and Cyril Terrioux
Dynamic Management of Heuristics for Solving Structured CSPs
Extending to Soft and Preference Constraints a Framework for Solving Efficiently Structured Problems
Actes JFPC 2006 Heuristiques pour la recherche numrative
Actes JFPC 2007 Un schema generique d'algorithmes enumeratifs
Calcul et exploitation de decompositions arborescentes pour la resolution de CSP
Annee 2009-2010 INITIATION AU LANGAGE C
Strategies and heuristics for exploiting tree-decompositions of constraint networks
Actes JFPC 2007 Recouvrement de probl`emes par des hypergraphes
A generic bounded backtracking framework for solving CSPs
Extending to Soft and Preference Constraints a Framework for Solving Efficiently Structured Problems
Actes JFPC 2008 Complexite de Forward Checking et Hierarchie des
Dynamic heuristics for branch and bound search on tree-decomposition of Weighted CSPs
Dynamic Heuristics for Backtrack Search on Tree-Decomposition of CSPs Philippe Jegou and Samba Ndojh Ndiaye and Cyril Terrioux
An extension of complexity bounds and dynamic heuristics for tree-decompositions of CSP
Approches compltes de rsolution de Samba Ndojh NDIAYE
Annee 2007 UNIVERSITE DE DROIT, D'ECONOMIE ET DES SCIENCES
Correction et completude Separation & Evaluation Programmation par contraintes Cours de Master Recherche
