default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMalika Mehdi
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j5]Youcef Djenouri
, Ahcène Bendjoudi, Zineb Habbas, Malika Mehdi, Djamel Djenouri:
Reducing thread divergence in GPU-based bees swarm optimization applied to association rule mining. Concurr. Comput. Pract. Exp. 29(9) (2017)- 2015
- [j4]Youcef Djenouri, Ahcène Bendjoudi, Malika Mehdi, Nadia Nouali-Taboudjemat, Zineb Habbas:
GPU-based bees swarm optimization for association rules mining. J. Supercomput. 71(4): 1318-1344 (2015) - [c9]Youcef Djenouri, Ahcène Bendjoudi, Malika Mehdi, Zineb Habbas, Nadia Nouali-Taboudjemat:
Data Reordering for Minimizing Threads Divergence in GPU-Based Evaluating Association Rules. DCAI 2015: 47-54 - 2014
- [j3]Mohand Mezmaz, Malika Mehdi, Pascal Bouvry, Nordine Melab, El-Ghazali Talbi, Daniel Tuyttens:
Solving the three dimensional quadratic assignment problem on a computational grid. Clust. Comput. 17(2): 205-217 (2014) - [c8]Youcef Djenouri, Ahcène Bendjoudi, Malika Mehdi, Nadia Nouali-Taboudjemat, Zineb Habbas:
Parallel association rules mining using GPUS and bees behaviors. SoCPaR 2014: 401-405 - [c7]Youcef Djenouri, Youcef Gheraibia, Malika Mehdi, Ahcène Bendjoudi, Nadia Nouali-Taboudjemat:
An efficient measure for evaluating association rules. SoCPaR 2014: 406-410 - 2013
- [c6]Ahcène Bendjoudi, Mehdi Chekini, Makhlouf Gharbi, Malika Mehdi, Karima Benatchba, Fatima Sitayeb-Benbouzid, Nouredine Melab:
Parallel B&B Algorithm for Hybrid Multi-core/GPU Architectures. HPCC/EUC 2013: 914-921 - 2012
- [j2]Lakhdar Loukil, Malika Mehdi, Nouredine Melab, El-Ghazali Talbi, Pascal Bouvry:
Parallel Hybrid Genetic Algorithms for Solving Q3AP on Computational Grid. Int. J. Found. Comput. Sci. 23(2): 483-500 (2012) - 2011
- [b1]Malika Mehdi:
Parallel Hybrid Optimization Methods For Permutation Based Problems. Lille University of Science and Technology, France, 2011 - [c5]Malika Mehdi, Jean-Claude Charr, Nouredine Melab, El-Ghazali Talbi, Pascal Bouvry:
A cooperative tree-based hybrid GA-B&B approach for solving challenging permutation-based problems. GECCO 2011: 513-520 - 2010
- [c4]Malika Mehdi, Nouredine Melab, El-Ghazali Talbi, Pascal Bouvry:
Interval-based initialization method for permutation-based problems. IEEE Congress on Evolutionary Computation 2010: 1-8
2000 – 2009
- 2009
- [j1]Malika Mehdi, Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Talbi, Pascal Bouvry:
P2P computing for large tree exploration-based exact optimisation. Int. J. Grid Util. Comput. 1(3): 252-260 (2009) - [c3]Malika Mehdi, Nouredine Melab, El-Ghazali Talbi, Pascal Bouvry:
Interval island model initialization for permutation-based problems. GECCO 2009: 1919-1920 - [c2]Lakhdar Loukil, Malika Mehdi, Nouredine Melab, El-Ghazali Talbi, Pascal Bouvry:
A parallel hybrid genetic algorithm-simulated annealing for solving Q3AP on computational grid. IPDPS 2009: 1-8 - 2008
- [c1]Malika Mehdi, Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Talbi, Pascal Bouvry:
An Efficient Hybrid P2P Approach for Non-redundant Tree Exploration in B&B Algorithms. CISIS 2008: 360-365
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:39 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:
