Nicolas Beldiceanu
Prof. Nicolas Beldiceanu
100%
Libre accès
6
Documents
Affiliations actuelles
- 489559
- 1088577
Identifiants chercheurs
- nicolasbeldiceanu
- Google Scholar : http://scholar.google.se/citations?user=yue1lQ8AAAAJ
- IdRef : 033488673
- 0000-0003-1452-596X
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
- 6
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
|
Using finite transducers for describing and synthesising structural time-series constraintsConstraints, 2016, 21 (1), pp.19. ⟨10.1007/s10601-015-9200-3⟩
Article dans une revue
hal-01370322v1
|
|
Composing Biases by Using CP to Decompose Minimal Functional Dependencies for Acquiring Complex FormulaeAAAI 2024 - 38th Annual AAAI Conference on Artificial Intelligence, Feb 2024, Vancouver, Canada
Communication dans un congrès
hal-04460576v1
|
|
Boolean-Arithmetic Equations: Acquisition and UsesCPAIOR 2023 - 20th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, May 2023, Nice, France. pp.378-394, ⟨10.1007/978-3-031-33271-5_25⟩
Communication dans un congrès
hal-04460561v1
|
|
Acquiring Maps of Interrelated Conjectures on Sharp BoundsCP 2022 - 28th International Conference on Principles and Practice of Constraint Programming, Jul 2022, Haifa, Israel. pp.1-18, ⟨10.4230/LIPIcs.CP.2022.6⟩
Communication dans un congrès
hal-03789045v1
|
|
Time-Series Constraints: Improvements and Application in CP and MIP ContextsCPAIOR 2016 - 13th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming, May 2016, Banff, Canada. pp.18-34, ⟨10.1007/978-3-319-33954-2⟩
Communication dans un congrès
hal-01355262v1
|
|
Global Constraint Catalog, Volume II, Time-Series Constraints[Technical Report] IMT Atlantique. 2018, pp.1-3762
Rapport
hal-01374721v1
|