default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohammad Fadel Jamil Klaib
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j4]R. Gurunath
, Mohammad Fadel Jamil Klaib, Debabrata Samanta, Mohammad Zubair Khan:
Social Media and Steganography: Use, Risks and Current Status. IEEE Access 9: 153656-153665 (2021)- 2014
- [j3]Mohammad Subhi Al-Batah, Nor Ashidi Mat Isa, Mohammad Fadel Jamil Klaib, Mohammed Azmi Al-Betar:
Multiple Adaptive Neuro-Fuzzy Inference System with Automatic Features Extraction Algorithm for Cervical Cancer Recognition. Comput. Math. Methods Medicine 2014: 181245:1-181245:12 (2014) - 2011
- [j2]Kamal Zuhairi Zamli, Mohammad F. J. Klaib, Mohammed Issam Younis, Nor Ashidi Mat Isa, Rusli Abdullah:
Design and implementation of a t-way test data generation strategy with automated execution tool support. Inf. Sci. 181(9): 1741-1758 (2011) - 2010
- [j1]Mohammed Issam Younis, Kamal Zuhairi Zamli, Mohammad F. J. Klaib, Zainal Hisham Che Soh, Syahrul Afzal Che Abdullah, Nor Ashidi Mat Isa:
Assessing IRPS as an efficient pairwise test data generation strategy. Int. J. Adv. Intell. Paradigms 2(1): 90-104 (2010)
Conference and Workshop Papers
- 2011
- [c10]Khandakar Fazley Rabbi, Sabira Khatun, Che Yahaya Yaakub, Mohammad F. J. Klaib:
EasyA: Easy and Effective Way to Generate Pairwise Test Data. CICSyN 2011: 164-167 - [c9]Mohammad F. J. Klaib, Sangeetha Muthuraman, Ahmad Noraziah:
A Parallel Tree Based Strategy for T-Way Combinatorial Interaction Testing. ICSECS (3) 2011: 91-98 - [c8]Sabira Khatun, Khandakar Fazley Rabbi, Che Yahaya Yaakub, Mohammad F. J. Klaib, Mohammad Masroor Ahmed:
PS2Way: An Efficient Pairwise Search Approach for Test Data Generation. ICSECS (3) 2011: 99-108 - [c7]Noraziah Ahmad, Roslina Mohd Sidek, Mohammad F. J. Klaib, Ainul Azila Che Fauzi, Mohd Helmy Abd Wahab, Wan Maseri Binti Wan Mohd:
Preserving Data Replication Consistency through ROWA-MSTS. ICSECS (2) 2011: 244-253 - 2010
- [c6]Noraziah Ahmad, Mohammad Fadel Jamil Klaib, Roslina Mohd Sidek:
Failure Semantic of Neighbour Replication Grid Transaction Model. CIT 2010: 668-673 - [c5]Mohammad F. J. Klaib, Sangeetha Muthuraman, Noraziah Ahmad, Roslina Mohd Sidek:
A Tree Based Strategy for Test Data Generation and Cost Calculation for Uniform and Non-Uniform Parametric Values. CIT 2010: 1376-1383 - [c4]Noraziah Ahmad, Noriyani Mat Zin, Roslina Mohd Sidek, Mohammad Fadel Jamil Klaib, Mohd Helmy Abd Wahab:
Neighbour Replica Transaction Failure Framework in Data Grid. NDT (2) 2010: 488-495 - [c3]Mohammad F. J. Klaib, Sangeetha Muthuraman, Noraziah Ahmad, Roslina Mohd Sidek:
A Parallel Tree Based Strategy for Test Data Generation and Cost Calculation for Pairwise Combinatorial Interaction Testing. NDT (2) 2010: 509-522 - [c2]Roslina Mohd Sidek, Noraziah Ahmad, Mohammad Fadel Jamil Klaib, Mohd Helmy Abd Wahab:
Expediency Heuristic in University Conference Webpage. NDT (1) 2010: 566-576 - 2008
- [c1]Mohammad F. J. Klaib, Kamal Zuhairi Zamli, Nor Ashidi Mat Isa, Mohammed Issam Younis, Rusli Abdullah:
G2Way A Backtracking Strategy for Pairwise Test Data Generation. APSEC 2008: 463-470
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-24 23:08 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:
