default search action
Ahcène Bendjoudi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j16]Nassim Sadallah, Saïd Yahiaoui, Ahcène Bendjoudi, Nadia Nouali-Taboudjemat:
Multi-objective offline and online path planning for UAVs under dynamic urban environment. Int. J. Intell. Robotics Appl. 6(1): 119-138 (2022) - [j15]Adel Dabah, Ibrahim Chegrane, Saïd Yahiaoui, Ahcène Bendjoudi, Nadia Nouali-Taboudjemat:
Efficient parallel branch-and-bound approaches for exact graph edit distance problem. Parallel Comput. 114: 102984 (2022) - [c20]Ibrahim Chegrane, Imane Hocine, Saïd Yahiaoui, Ahcène Bendjoudi, Nadia Nouali-Taboudjemat:
Graph Edit Distance Compacted Search Tree. SISAP 2022: 181-189 - 2021
- [j14]Imane Hocine, Saïd Yahiaoui, Ahcène Bendjoudi, Nadia Nouali-Taboudjemat:
Reachability in big graphs: A distributed indexing and querying approach. Inf. Sci. 573: 541-561 (2021) - 2020
- [j13]Leila Hamdad, Zakaria Ournani, Karima Benatchba, Ahcène Bendjoudi:
Two-level parallel CPU/GPU-based genetic algorithm for association rule mining. Int. J. Comput. Sci. Eng. 22(2/3): 335-345 (2020)
2010 – 2019
- 2019
- [j12]Youcef Djenouri, Djamel Djenouri, Asma Belhadi, Philippe Fournier-Viger, Jerry Chun-Wei Lin, Ahcène Bendjoudi:
Exploiting GPU parallelism in improving bees swarm optimization for mining big transactional databases. Inf. Sci. 496: 326-342 (2019) - [j11]Adel Dabah, Ahcène Bendjoudi, Abdelhakim AitZai, Nadia Nouali-Taboudjemat:
Efficient parallel tabu search for the blocking job shop scheduling problem. Soft Comput. 23(24): 13283-13295 (2019) - [c19]Youcef Djenouri, Djamel Djenouri, Asma Belhadi, Jerry Chun-Wei Lin, Ahcène Bendjoudi, Philippe Fournier-Viger:
A Novel Parallel Framework for Metaheuristic-based Frequent Itemset Mining. CEC 2019: 1439-1445 - [c18]Leila Hamdad, Karima Benatchba, Ahcène Bendjoudi, Zakaria Ournani:
Impact of Genetic Algorithms Operators on Association Rules Extraction. IWANN (2) 2019: 747-759 - 2018
- [j10]Adel Dabah, Ahcène Bendjoudi, Abdelhakim AitZai, Didier El Baz, Nadia Nouali-Taboudjemat:
Hybrid multi-core CPU and GPU-based B&B approaches for the blocking job shop scheduling problem. J. Parallel Distributed Comput. 117: 73-86 (2018) - 2017
- [j9]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) - [c17]Youcef Djenouri, Ahcène Bendjoudi, Djamel Djenouri, Marco Comuzzi:
GPU-based Bio-inspired Model for Solving Association Rules Mining Problem. PDP 2017: 262-269 - [c16]Youcef Djenouri, Ahcène Bendjoudi, Djamel Djenouri, Asma Belhadi, Nadia Nouali-Taboudjemat:
New GPU-based swarm intelligence approach for reducing big association rules space. SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI 2017: 1-6 - 2016
- [c15]Adel Dabah, Ahcène Bendjoudi, Abdelhakim AitZai, Didier El Baz, Nadia Nouali-Taboudjemat:
Multi and many-core parallel B&B approaches for the Blocking Job Shop Scheduling problem. HPCS 2016: 705-712 - [c14]Adel Dabah, Ahcène Bendjoudi, Abdelhakim AitZai:
Efficient parallel B&B method for the blocking job shop scheduling problem. HPCS 2016: 784-791 - [c13]Adel Dabah, Ahcène Bendjoudi, Didier El Baz, Abdelhakim AitZai:
GPU-Based Two Level Parallel B&B for the Blocking Job Shop Scheduling Problem. IPDPS Workshops 2016: 747-755 - 2015
- [j8]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) - [c12]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 - [c11]Youcef Djenouri, Ahcène Bendjoudi, Djamel Djenouri, Zineb Habbas:
Parallel BSO Algorithm for Association Rules Mining Using Master/Worker Paradigm. PPAM (1) 2015: 258-268 - 2014
- [j7]Nouredine Melab, Imen Chakroun, Ahcène Bendjoudi:
Graphics processing unit-accelerated bounding for branch-and-bound applied to a permutation problem using data access optimization. Concurr. Comput. Pract. Exp. 26(16): 2667-2683 (2014) - [j6]Youcef Djenouri, Habiba Drias, Ahcène Bendjoudi:
Pruning irrelevant association rules using knowledge mining. Int. J. Bus. Intell. Data Min. 9(2): 112-144 (2014) - [j5]Ahcène Bendjoudi, Nouredine Melab, El-Ghazali Talbi:
FTH-B&B: A Fault-Tolerant HierarchicalBranch and Bound for Large ScaleUnreliable Environments. IEEE Trans. Computers 63(9): 2302-2315 (2014) - [c10]Youcef Djenouri, Ahcène Bendjoudi, Nadia Nouali-Taboudjemat, Zineb Habbas:
An Improved Evolutionary Approach for Association Rules Mining. BIC-TA 2014: 93-97 - [c9]Ali Benssam, Ahcène Bendjoudi, Saïd Yahiaoui, Nadia Nouali-Taboudjemat, Omar Nouali:
Towards a dynamic evacuation system for disaster situations. ICT-DM 2014: 1-8 - [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
- [j4]Imen Chakroun, Mohand-Said Mezmaz, Nouredine Melab, Ahcène Bendjoudi:
Reducing thread divergence in a GPU-accelerated branch-and-bound algorithm. Concurr. Comput. Pract. Exp. 25(8): 1121-1136 (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
- [b1]Ahcène Bendjoudi:
Scalable And Fault Tolerant Hierarchical B&B Algorithms For Computational Grids. University of Béjaïa, Algeria, 2012 - [j3]Ahcène Bendjoudi, Nouredine Melab, El-Ghazali Talbi:
Hierarchical branch and bound algorithm for computational grids. Future Gener. Comput. Syst. 28(8): 1168-1176 (2012) - [j2]Ahcène Bendjoudi, Nordine Melab, El-Ghazali Talbi:
An adaptive hierarchical master-worker (AHMW) framework for grids - Application to B&B algorithms. J. Parallel Distributed Comput. 72(2): 120-131 (2012) - [c5]Trong-Tuan Vu, Bilel Derbel, Ali Asim, Ahcène Bendjoudi, Nouredine Melab:
Overlay-Centric Load Balancing: Applications to UTS and B&B. CLUSTER 2012: 382-390 - 2011
- [c4]Ahcène Bendjoudi, Nouredine Melab, El-Ghazali Talbi:
Fault-Tolerant Mechanism for Hierarchical Branch and Bound Algorithm. IPDPS Workshops 2011: 1806-1814 - [c3]Imen Chakroun, Ahcène Bendjoudi, Nouredine Melab:
Reducing Thread Divergence in GPU-Based B&B Applied to the Flow-Shop Problem. PPAM (1) 2011: 559-568
2000 – 2009
- 2009
- [j1]Ahcène Bendjoudi, Nouredine Melab, El-Ghazali Talbi:
P2P design and implementation of a parallel branch and bound algorithm for grids. Int. J. Grid Util. Comput. 1(2): 159-168 (2009) - 2007
- [c2]Ahcène Bendjoudi, Nouredine Melab, El-Ghazali Talbi:
A Parallel P2P Branch-and-Bound Algorithm for Computational Grids. CCGRID 2007: 749-754 - [c1]El-Ghazali Talbi, Ahcène Bendjoudi, Nouredine Melab:
Parallel Branch and Bound on P2P Systems. CISIS 2007: 271-278
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-10-07 21:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint