Farouk Belkadi

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Benoît Furet

> Home > Persons > Farouk Belkadi

Publications

2021
[j15]
- view
  authority control:
- export record
  dblp key:
  - journals/ijpr/MeskiBLRF21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijpr/MeskiBLRF21
Oussama Meski, Farouk Belkadi, Florent Laroche, Mathieu Ritou, Benoît Furet:
A generic knowledge management approach towards the development of a decision support system. Int. J. Prod. Res. 59(22): 6659-6676 (2021)
2019
[c15]
- view
  - electronic edition @ editions-rnti.fr (open access)
  - details & citations
- export record
  dblp key:
  - conf/f-egc/MeskiLBF19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/f-egc/MeskiLBF19
Oussama Meski, Florent Laroche, Farouk Belkadi, Benoît Furet:
La gestion des connaissances au coeur de la continuité numérique pour l'industrie 4.0 : Le cas du projet « SmartEmma ». EGC 2019: 381-382
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-1905-06413
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1905-06413
Mathieu Ritou, Farouk Belkadi, Zakaria Yahouni, Catherine Da Cunha, Florent Laroche, Benoît Furet:
Knowledge-based multi-level aggregation for decision aid in the machining industry. CoRR abs/1905.06413 (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.