Filter Results:
- Full text PDF available (3)
Publication Year
2005
2017
- This year (1)
- Last 5 years (8)
- Last 10 years (16)
Publication Type
Co-author
Journals and Conferences
Learn More
- A. K. Srivastava, Malika Mehdi
- Diabetic medicine : a journal of the British…
- 2005
Compounds of the trace element vanadium exert various insulin-like effects in in vitro and in vivo systems. These include their ability to improve glucose homeostasis and insulin resistance in animal… (More)
- Youcef Djenouri, Ahcène Bendjoudi, Malika Mehdi, Nadia Nouali-Taboudjemat, Zineb Habbas
- The Journal of Supercomputing
- 2014
Association rules mining (ARM) is a well-known combinatorial optimization problem aiming at extracting relevant rules from given large-scale datasets. According to the state of the art, the… (More)
- Youcef Djenouri, Youcef Gheraibia, Malika Mehdi, Ahcène Bendjoudi, Nadia Nouali-Taboudjemat
- 2014 6th International Conference of Soft…
- 2014
Association rules mining (ARM) has attracted a lot of attention in the last decade. It aims to extract a set of relevant rules from a given database. In order to evaluate the quality of the resulting… (More)
- Lakhdar Loukil, Malika Mehdi, Nouredine Melab, El-Ghazali Talbi, Pascal Bouvry
- Int. J. Found. Comput. Sci.
- 2012
- Malika Mehdi
- 2011
Solving efficiently large benchmarks of NP-hard permutation-based problems requires the development of hybrid methods combining different classes of optimization methods. Indeed, it is now… (More)
- Youcef Djenouri, Ahcène Bendjoudi, Zineb Habbas, Malika Mehdi, Djamel Djenouri
- Concurrency and Computation: Practice and…
- 2017
- Ahcène Bendjoudi, Mehdi Chekini, +4 authors Nouredine Melab
- HPCC/EUC
- 2013
- Mohand-Said Mezmaz, Malika Mehdi, Pascal Bouvry, Nouredine Melab, El-Ghazali Talbi, Daniel Tuyttens
- Cluster Computing
- 2013
The exact resolution of large instances of combinatorial optimization problems, such as three dimensional quadratic assignment problem (Q3AP), is a real challenge for grid computing. Indeed, it is… (More)
The Branch and Bound (B&B) algorithm is one of the most used methods to solve in an exact way combinatorial optimization problems. In a previous article, we proposed a new approach of the parallel… (More)