default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOmar Dib
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Omar Dib
, Zhenghan Nan, Jinkua Liu:
Machine learning-based ransomware classification of Bitcoin transactions. J. King Saud Univ. Comput. Inf. Sci. 36(1): 101925 (2024)- [j6]El-hacen Diallo, Mohameden Dieye, Omar Dib, Pierre Valiorgue:
An agnostic and secure interoperability protocol for seamless asset movement. J. Netw. Comput. Appl. 230: 103930 (2024) - 2023
- [c18]Omar Dib:
Three-Phase Hybrid Evolutionary Algorithm for the Bi-Objective Travelling Salesman Problem. CBI 2023: 173-186 - [c17]Weiye Tang, Daren Li, Wuyue Fan, Tianhao Liu, Man Chen, Omar Dib:
An Intrusion Detection System Empowered by Deep Learning Algorithms. DASC/PiCom/CBDCom/CyberSciTech 2023: 1137-1142 - [c16]Man Chen, Wuyue Fan, Weiye Tang, Tianhao Liu, Daren Li, Omar Dib:
Review of Machine Learning Algorithms for Breast Cancer Diagnosis. DMBD (2) 2023: 229-243 - 2022
- [c15]Changjie Lu, Shen Zheng, Zirui Wang, Omar Dib, Gaurav Gupta:
AS-IntroVAE: Adversarial Similarity Distance Makes Robust IntroVAE. ACML 2022: 658-673 - [c14]El-hacen Diallo, Omar Dib, Khaldoun Al Agha:
Secure and scalable Blockchain-enabled traffic data management using a trust model. BCCA 2022: 69-75 - [c13]Jianxuan Liu, Haotian Xue, Junfeng Wang, Shuo Hong, Hao Fu, Omar Dib:
A Systematic Comparison on Prevailing Intrusion Detection Models. PDCAT 2022: 213-224 - [i1]Changjie Lu, Shen Zheng, Zirui Wang, Omar Dib, Gaurav Gupta:
AS-IntroVAE: Adversarial Similarity Distance Makes Robust IntroVAE. CoRR abs/2206.13903 (2022) - 2021
- [c12]Zian Jin, Omar Dib, Yueting Luo, Bingxu Hu:
A Non-Dominated Sorting Memetic Algorithm for the Multi-Objective Travelling Salesman Problem. ACAI 2021: 19:1-19:6 - [c11]El-hacen Diallo, Omar Dib, Khaldoun Al Agha:
On the Adaptation of Bitcoin-Like Blockchains for the Secure Storage of Traffic-Related Events. AINA (1) 2021: 195-207 - [c10]El-Hacen Diallo, Omar Dib, Khaldoun Al Agha:
The journey of Blockchain inclusion in Vehicular Networks: A Taxonomy. BCCA 2021: 135-142 - [c9]Wanying Dou, Yihang Liu, Zehai Liu, Dauren Yerezhepov, Ulan Kozhamkulov, Ainur Akilzhanova, Omar Dib, Chee-Kai Chan:
An AutoML Approach for Predicting Risk of Progression to Active Tuberculosis based on Its Association with Host Genetic Variations. ICBBS 2021: 82-88 - [c8]Zehai Liu, Gengchen Tian, Jiarui Zhu, Weikang Chen, Wanying Dou, Chun-Te Lee, Chee-Kai Chan, Omar Dib:
Machine Learning Approaches to Investigate the Relationship between Genetic Factors and Autism Spectrum Disorder. MLMI 2021: 164-171 - [c7]Yang Qiu, Haomiao Li, Xiao Wang, Omar Dib:
On the adoption of Metaheuristics for Solving 0-1 Knapsack Problems. PAAP 2021: 56-61 - [c6]Yueting Luo, Omar Dib, Zian Jin, Bingxu Hu:
A New Memetic Algorithm to Solve the Stochastic TSP. PAAP 2021: 69-75 - 2020
- [j5]Kalpana Singh, Omar Dib, Clément Huyart, Khalifa Toumi:
A novel credential protocol for protecting personal attributes in blockchain. Comput. Electr. Eng. 83: 106586 (2020) - [j4]Omar Dib, Clément Huyart, Khalifa Toumi:
A novel data exploitation framework based on blockchain. Pervasive Mob. Comput. 61: 101104 (2020) - [c5]El-hacen Diallo, Khaldoun Al Agha, Omar Dib, Alexandre Laubé, Hafedh Mohamed-Babou:
Toward Scalable Blockchain for Data Management in VANETs. AINA Workshops 2020: 233-244
2010 – 2019
- 2018
- [j3]Omar Dib, Mohammad Dib, Alexandre Caminada:
Computing Multicriteria Shortest Paths in Stochastic Multimodal Networks Using a Memetic Algorithm. Int. J. Artif. Intell. Tools 27(7): 1860012:1-1860012:25 (2018) - 2017
- [b1]Omar Dib:
Dynamic rerouting in multimodal transportation networks. (Reroutage dynamique des passagers dans les réseaux de transport multimodaux). University of Burgundy - Franche-Comté, France, 2017 - [j2]Omar Dib, Marie-Ange Manier, Laurent Moalic, Alexandre Caminada:
Combining VNS with Genetic Algorithm to solve the one-to-one routing issue in road networks. Comput. Oper. Res. 78: 420-430 (2017) - [j1]Omar Dib, Laurent Moalic, Marie-Ange Manier, Alexandre Caminada:
An advanced GA-VNS combination for multicriteria route planning in public transit networks. Expert Syst. Appl. 72: 67-82 (2017) - [c4]Omar Dib, Alexandre Caminada, Marie-Ange Manier, Laurent Moalic:
A memetic algorithm for computing multicriteria shortest paths in stochastic multimodal networks. GECCO (Companion) 2017: 103-104 - [c3]Omar Dib, Alexandre Caminada, Marie-Ange Manier, Laurent Moalic:
Computing Multicriteria Shortest Paths in Stochastic Multimodal Networks Using a Memetic Algorithm. ICTAI 2017: 1158-1165 - 2016
- [c2]Omar Dib, Marie-Ange Manier, Laurent Moalic:
Advanced modeling approach for computing multicriteria shortest paths in multimodal transportation networks. ICITE 2016: 40-44 - 2015
- [c1]Omar Dib, Marie-Ange Manier, Alexandre Caminada:
A Hybrid Metaheuristic for Routing in Road Networks. ITSC 2015: 765-770
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 22:20 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:
