The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Patrice Boizumault: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Patrice Boizumault, Yan Delon, Laurent Péridy
    A CLP Approach for Examination Planning. [Citation Graph (0, 0)][DBLP]
    Constraint Processing, Selected Papers, 1995, pp:85-101 [Conf]
  2. Narendra Jussien, Patrice Boizumault
    Implementing Constraint Relaxation over Finite Domains Using Assumption-Based Truth Maintenance Systems. [Citation Graph (0, 0)][DBLP]
    Over-Constrained Systems, 1995, pp:265-280 [Conf]
  3. Narendra Jussien, Romuald Debruyne, Patrice Boizumault
    Maintaining Arc-Consistency within Dynamic Backtracking. [Citation Graph (0, 0)][DBLP]
    CP, 2000, pp:249-261 [Conf]
  4. Muriel Lauvergne, Philippe David, Patrice Boizumault
    Connections Reservation with Rerouting for ATM Networks: A Hybrid Approach with Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:649-663 [Conf]
  5. Patrice Boizumault
    A Classical Implementation for Prolog-II. [Citation Graph (0, 0)][DBLP]
    ESOP, 1986, pp:262-273 [Conf]
  6. Samir Ouis, Narendra Jussien, Patrice Boizumault
    k-relevant Explanations for Constraint Programming. [Citation Graph (0, 0)][DBLP]
    FLAIRS Conference, 2003, pp:192-196 [Conf]
  7. Olivier Ridoux, Patrice Boizumault, Frédéric Malésieux
    Typed Static Analysis: Application to Groundness Analysis of PROLOG and lambda-PROLOG. [Citation Graph (0, 0)][DBLP]
    Fuji International Symposium on Functional and Logic Programming, 1999, pp:267-283 [Conf]
  8. Patrice Boizumault
    A General Model to Implement DIF and FREEZE. [Citation Graph (0, 0)][DBLP]
    ICLP, 1986, pp:585-592 [Conf]
  9. Frédéric Malésieux, Olivier Ridoux, Patrice Boizumault
    Abstract Compilation of lambda-Prolog. [Citation Graph (0, 0)][DBLP]
    IJCSLP, 1998, pp:130-144 [Conf]
  10. Samir Loudni, Patrice Boizumault
    A New Hybrid Method for Solving Constraint Optimization Problems in Anytime Contexts. [Citation Graph (0, 0)][DBLP]
    ICTAI, 2001, pp:325-332 [Conf]
  11. Samir Loudni, Patrice Boizumault
    Solving Constraint Optimization Problems in Anytime Contexts. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2003, pp:251-256 [Conf]
  12. Patrice Boizumault
    Sur la transformation de l'appel terminal en itération dans un interprète PROLOG. [Citation Graph (0, 0)][DBLP]
    SPLT, 1983, pp:- [Conf]
  13. Patrice Boizumault
    Un modèle de trace pour PROLOG. [Citation Graph (0, 0)][DBLP]
    SPLT, 1984, pp:- [Conf]
  14. Narendra Jussien, Patrice Boizumault
    Maintien de déduction pour la relaxation de contraintes. [Citation Graph (0, 0)][DBLP]
    JFPLC, 1996, pp:239-254 [Conf]
  15. Narendra Jussien, Patrice Boizumault
    Stratégies en meilleur d'abord pour la relaxation de contraintes. [Citation Graph (0, 0)][DBLP]
    JFPLC, 1997, pp:149-0 [Conf]
  16. Samir Loudni, Patrice Boizumault, Philippe David
    Réservation en ligne avec reroutage de demandes de connexion dans les réseaux ATM. [Citation Graph (0, 0)][DBLP]
    JFPLC, 2003, pp:169-182 [Conf]
  17. Samir Ouis, Narendra Jussien, Patrice Boizumault
    Explications k-relevantes pour la programmation par contraintes. [Citation Graph (0, 0)][DBLP]
    JFPLC, 2003, pp:111-124 [Conf]
  18. Frédéric Malésieux, Olivier Ridoux, Patrice Boizumault
    Compilation abstraite de LambdaProlog. [Citation Graph (0, 0)][DBLP]
    JFPLC, 1998, pp:287-0 [Conf]
  19. Frédéric Malésieux, Olivier Ridoux, Patrice Boizumault
    Analyse statique typée: application à l'analyse de clôtures de lambda-Prolog. [Citation Graph (0, 0)][DBLP]
    JFPLC, 1999, pp:55-72 [Conf]
  20. Samir Ouis, Narendra Jussien, Patrice Boizumault
    COINS: a constraint-based interactive solving system. [Citation Graph (0, 0)][DBLP]
    WLPE, 2002, pp:31-46 [Conf]
  21. Christelle Guéret, Narendra Jussien, Patrice Boizumault, Christian Prins
    Building University Timetables Using Constraint Logic Programming. [Citation Graph (0, 0)][DBLP]
    PATAT, 1995, pp:130-145 [Conf]
  22. Patrice Boizumault, Yan Delon, Laurent Péridy
    Solving a real life exams problem using CHIP. [Citation Graph (0, 0)][DBLP]
    ILPS, 1993, pp:661- [Conf]
  23. Narendra Jussien, Patrice Boizumault
    Best-First Search for Property Maintenance in Reactive Constraint Systems. [Citation Graph (0, 0)][DBLP]
    ILPS, 1997, pp:339-353 [Conf]
  24. Samir Loudni, Patrice Boizumault, Philippe David
    On-line resources allocation for ATM networks with rerouting. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:10, pp:2891-2917 [Journal]
  25. Samir Ouis, Narendra Jussien, Patrice Boizumault
    COINS: a constraint-based interactive solving system [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  26. Olivier Ridoux, Patrice Boizumault
    Typed Static Analysis: Application to the Groundness Analysis of Typed Prolog. [Citation Graph (0, 0)][DBLP]
    Journal of Functional and Logic Programming, 2001, v:2001, n:4, pp:- [Journal]
  27. Patrice Boizumault, Yan Delon, Laurent Péridy
    Constraint Logic Programming for Examination Timetabling. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1996, v:26, n:2, pp:217-233 [Journal]
  28. Patrice Boizumault, Philippe David, Samir Loudni
    Réservation en ligne avec reroutage de demandes de connexion dans les réseaux ATM. [Citation Graph (0, 0)][DBLP]
    Technique et Science Informatiques, 2003, v:22, n:1, pp:169-182 [Journal]
  29. Patrice Boizumault, Narendra Jussien, Samir Ouis
    Explications k-relevantes pour la programmation par contraintes. [Citation Graph (0, 0)][DBLP]
    Technique et Science Informatiques, 2003, v:22, n:1, pp:111-124 [Journal]

  30. Solving Nurse Rostering Problems Using Soft Global Constraints. [Citation Graph (, )][DBLP]


  31. Allier CSPs et motifs locaux pour la découverte de motifs sous contraintes n-aires. [Citation Graph (, )][DBLP]


  32. Boosting VNS with Neighborhood Heuristics for Solving Constraint Optimization Problems. [Citation Graph (, )][DBLP]


  33. Combining CSP and Constraint-Based Mining for Pattern Discovery. [Citation Graph (, )][DBLP]


  34. All Different: Softening AllDifferent in Weighted CSPs. [Citation Graph (, )][DBLP]


  35. A Value Ordering Heuristic for Weighted CSP. [Citation Graph (, )][DBLP]


  36. Softening Gcc and Regular with preferences. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002