default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHubert Kadima
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[c13]Fatima-Zahra Berriche, Besma Zeddini, Hubert Kadima, Alain Rivière:
CBR-Mining Approach to Improve Learning System Engineering in a Collaborative E-Learning Platform. COMPLEXIS 2018: 94-101- 2016
- [j2]Dalia Sulieman, Maria Malek
, Hubert Kadima, Dominique Laurent:
Toward Social-Semantic Recommender Systems. Int. J. Inf. Syst. Soc. Chang. 7(1): 1-30 (2016) - [c12]Fatima-Zahra Berriche, Besma Zeddini, Hubert Kadima, Alain Rivière:
Closed-Loop Product Lifecycle Management Based on a Multi-agent System for Decision Making in Collaborative Design. KSEM 2016: 540-551 - 2015
- [c11]Fatima-Zahra Berriche, Besma Zeddini, Hubert Kadima, Alain Rivière:
Combining Case-Based Reasoning and Process Mining to improve collaborative decision-making in products design. AICCSA 2015: 1-7 - 2013
- [j1]Sonia Yassa, Jérémie Sublime, Rachid Chelouah, Hubert Kadima, GeunSik Jo, Bertrand Granado:
A genetic algorithm for multi-objective optimisation in workflow scheduling with hard constraints. Int. J. Metaheuristics 2(4): 415-433 (2013) - [c10]Faïda Mhenni, Nga Nguyen, Hubert Kadima, Jean-Yves Choley:
Safety analysis integration in a SysML-based complex system design process. SysCon 2013: 70-75 - 2012
- [c9]Dalia Sulieman, Maria Malek, Hubert Kadima, Dominique Laurent:
Graph Searching Algorithms for Semantic-Social Recommendation. ASONAM 2012: 733-738 - [c8]Dalia Sulieman, Maria Malek, Hubert Kadima, Dominique Laurent:
Recommendation algorithm as application in Semantic Social Network. EGC 2012: 585-586 - [c7]Dalia Sulieman, Maria Malek, Hubert Kadima, Dominique Laurent:
Exploiting Semantic and Social Information in Recommendation Algorithms. ISIP 2012: 91-100 - [c6]Nga Nguyen, Hubert Kadima:
SysML Parametric Models for Complex System Performance Analysis - A Case Study. SIMULTECH 2012: 321-327 - [c5]Maria Malek, Hubert Kadima:
Searching Frequent Itemsets by Clustering Data: Towards a Parallel Approach Using Mapreduce. WISE Workshops 2012: 251-258 - 2011
- [c4]Jean-Yves Choley, Régis Plateaux, Olivia Penas, Christophe Combastel, Hubert Kadima:
Mechatronic System Modeling - A Consistent Preliminary Design Process. SIMULTECH 2011: 57-64 - [c3]Jean-Yves Choley, Régis Plateaux, Olivia Penas, Christophe Combastel, Hubert Kadima:
A Consistent Preliminary Design Process for Mechatronic Systems. SIMULTECH (Selected Papers) 2011: 101-112 - 2010
- [c2]Hubert Kadima, Maria Malek:
Toward ontology-based personalization of a recommender system in social network. SoCPaR 2010: 119-122
2000 – 2009
- 2002
- [c1]Valérie Monfort, Hubert Kadima:
Extending The Unified Process With Composition. SC@ETAPS 2002: 129-141
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
