Accéder directement au contenu

Nicolas Beldiceanu

Prof. Nicolas Beldiceanu
2
Documents
Affiliations actuelles
  • 489559
  • 1088577
Identifiants chercheurs
Contact

Présentation

**Professor in computer science, IMT Atlantique, LS2N-CNRS**, 2003-current (Nantes, France) Research in constraint programming: - global constraints and structural time-series constraints - efficient filtering algorithms - describing constraints (with meta data, graph, automata, transducers) - synthesizing/learning combinatorial knowledge maps - learning constraints models Senior researcher at SICS, 1999-2003 (Uppsala Sweden) In charge of research at COSYTEC, 1990-1999 (Paris area, France) Researcher at European Computer-Industry Research Centre, 1988-1989 (Munich, Germany) **Education** University Pierre et Marie Curie, PhD in Computer Science, 1983-1988 (Programmeur d'Etude, Maîtrise, DEA systèmes informatiques, PhD thesis under supervision of Claude Girault: A rule language and an inference engine based on constraints and actions: application to Petri nets) University Pierre et Marie Curie, HDR, 2003 (Global constraints: algorithmic and declarative aspects) **Award** 2017: ACP Award for Research Excellence in Constraint Programming ([slides](https://www.dropbox.com/s/1uf7fozzalqd4vf/slides_acp_award_2017.pdf?dl=0))

Publications

jean-charles-regin

An O(n log n) Bound Consistency Algorithm for the Conjunction of an alldifferent and an Inequality between a Sum of Variables and a Constant, and its Generalization

Nicolas Beldiceanu , Mats Carlsson , Thierry Petit , Jean-Charles Régin
20th European Conference on Artificial Intelligence (ECAI'12), Aug 2012, Montpellier, France. pp.145-150, ⟨10.3233/978-1-61499-098-7-145⟩
Communication dans un congrès hal-00754079v1

A Theta(n) Bound-Consistency Algorithm for the Increasing Sum Constraint

Thierry Petit , Jean-Charles Régin , Nicolas Beldiceanu
17th International Conference on Principles and Practice of Constraint Programming (CP'11), Sep 2011, Perugia, Italy. pp.721-728, ⟨10.1007/978-3-642-23786-7_54⟩
Communication dans un congrès hal-00753385v1