Search Results - "Dabah, Adel"

Hybrid multi-core CPU and GPU-based B&B approaches for the blocking job shop scheduling problem by Dabah, Adel, Bendjoudi, Ahcène, AitZai, Abdelhakim, El-Baz, Didier, Taboudjemat, Nadia Nouali

“…The Branch and Bound algorithm (B&B) is a well known method for solving optimally Combinatorial Optimization Problems. This method is based on intelligent…”
Get full text

Efficient approximate approach for graph edit distance problem by Dabah, Adel, Chegrane, Ibrahim, Yahiaoui, Saïd

“…•Near optimal results, with a less than 5% deviation from optimal results of a DFS algorithm.•Fast execution time.•Scalable since it can deal with large…”
Get full text

Efficient parallel tabu search for the blocking job shop scheduling problem by Dabah, Adel, Bendjoudi, Ahcene, AitZai, Abdelhakim, Taboudjemat, Nadia Nouali

“…The Blocking Job Shop Scheduling (BJSS) is an NP-hard scheduling problem. It is obtained from the classical job shop scheduling problem by replacing the…”
Get full text

Efficient parallel branch-and-bound approaches for exact graph edit distance problem by Dabah, Adel, Chegrane, Ibrahim, Yahiaoui, Saïd, Bendjoudi, Ahcene, Nouali-Taboudjemat, Nadia

“…Graph Edit Distance (GED) is a well-known measure used in the graph matching to measure the similarity/dissimilarity between two graphs by computing the…”
Get full text

Accelerated search over encrypted cloud data by Boucenna, Fateh, Nouali, Omar, Dabah, Adel, Kechid, Samir

“…Companies and other organizations such as hospitals seek more and more to enjoy the benefits of cloud computing in terms of storage space and computing power…”
Get full text

Learning-based Selection process for Branch and Bound Algorithms by Rihane, Karima, Dabah, Adel, AitZai, Abdelhakim

“…Branch and Bound (B&B) algorithms represent a well-known tool for optimally solving combinatorial optimization problems in general and scheduling problems in…”
Get full text

Signal Detection for Large MIMO Systems Using Sphere Decoding on FPGAs by Hassan, Mohamed W., Dabah, Adel, Ltaief, Hatem, Fahmy, Suhaib A.

“…Wireless communication systems rely on aggressive spatial multiplexing Multiple-Input Multiple-Output (MIMO) access points to enhance network throughput. A…”
Get full text

Efficient parallel B&B method for the blocking job shop scheduling problem by Dabah, Adel, Bendjoudi, Ahcene, AitZai, Abdelhakim

“…The blocking job shop scheduling problem (BJSS) is a version of the classical job shop scheduling with no intermediate buffer between machines. It is known to…”
Get full text

Application-Driven Exascale: The JUPITER Benchmark Suite by Herten, Andreas, Achilles, Sebastian, Alvarez, Damian, Badwaik, Jayesh, Behle, Eric, Bode, Mathis, Breuer, Thomas, Caviedes-Voullième, Daniel, Cherti, Mehdi, Dabah, Adel, Sayed, Salem El, Frings, Wolfgang, Gonzalez-Nicolas, Ana, Gregory, Eric B, Mood, Kaveh Haghighi, Hater, Thorsten, Jitsev, Jenia, John, Chelsea Maria, Meinke, Jan H, Meyer, Catrin I, Mezentsev, Pavel, Mirus, Jan-Oliver, Nassyr, Stepan, Penke, Carolin, Römmer, Manoel, Sinha, Ujjwal, Vieth, Benedikt von St, Stein, Olaf, Suarez, Estela, Willsch, Dennis, Zhukov, Ilya

“…2024 SC24: International Conference for High Performance Computing, Networking, Storage and Analysis SC Benchmarks are essential in the design of modern HPC…”
Get full text

GPU-Based Two Level Parallel B&B for the Blocking Job Shop Scheduling Problem by Dabah, Adel, Bendjoudi, Ahcene, El-Baz, Didier, AitZai, Abdelhakim

“…Branch and bound algorithm (B&B) is a well known technique for solving optimally combinatorial optimization problems. Nevertheless, these algorithms remain…”
Get full text

Multi and many-core parallel B&B approaches for the Blocking Job Shop Scheduling problem by Dabah, Adel, Bendjoudi, Ahcene, AitZai, Abdelhakim, El-Baz, Didier, Nouali Taboudjemat, Nadia

“…In this paper, we propose three approaches to accelerate the B&B execution time using Multi and Manycore systems to solve the NP-hard Blocking Job Shop…”
Get full text