default search action
Abdulaziz Alkhalid
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [c14]Itaf O. Joudeh
, Ana-Maria Cretu, R. Bruce Wallace, Rafik A. Goubran, Abdulaziz Alkhalid, Michel Allegue-Martínez, Frank Knoefel:
WiFi Channel State Information-Based Recognition of Sitting-Down and Standing-Up Activities. MeMeA 2019: 1-6 - 2018
- [c13]Abdulaziz Alkhalid, Yvan Labiche:
On Graphical User Interface Verification. ICSOFT 2018: 407-414 - [c12]Abdulaziz Alkhalid, Yvan Labiche:
Towards GUI Functional Verification using Abstract Interpretation. ICSOFT 2018: 415-422 - [c11]Abdulaziz Alkhalid, Yvan Labiche, Sashank Nekkanti:
Revisiting the Notion of GUI Testing. ICSOFT 2018: 674-681 - 2017
- [c10]Abdulaziz Alkhalid, Yvan Labiche
How Does GUI Testing Exercise Application Logic Functionality? COMPSAC (2) 2017: 90-95 - 2013
- [j3]Abdulaziz Alkhalid, Talha Amin, Igor Chikalov, Shahid Hussain
Optimization and analysis of decision trees and rules: dynamic programming approach. Int. J. Gen. Syst. 42(6): 614-634 (2013) - [c9]Abdulaziz Alkhalid, Chung-Horng Lung, Samuel Ajila
Software architecture decomposition using adaptive K-nearest neighbor algorithm. CCECE 2013: 1-4 - [c8]Abdulaziz Alkhalid, Chung-Horng Lung, Samuel Ajila
Towards Efficient Software Deployment in the Cloud Using Requirements Decomposition. CloudCom (2) 2013: 100-105 - [c7]Abdulaziz Alkhalid, Chung-Horng Lung, Duo Liu, Samuel Ajila
Software Architecture Decomposition Using Clustering Techniques. COMPSAC 2013: 806-811 - [p1]Abdulaziz Alkhalid, Igor Chikalov, Mikhail Moshkov
Comparison of Greedy Algorithms for Decision Tree Optimization. Rough Sets and Intelligent Systems (2) 2013: 21-40 - 2012
- [c6]Anshuman Biswas, Abdulaziz Alkhalid, Thomas Kunz, Chung-Horng Lung:
A lightweight defence against the Packet in Packet attack in ZigBee networks. Wireless Days 2012: 1-3 - 2011
- [j2]Abdulaziz Alkhalid, Mohammad R. Alshayeb
Software refactoring at the package level using clustering techniques. IET Softw. 5(3): 276-284 (2011) - [c5]Abdulaziz Alkhalid, Igor Chikalov, Mikhail Moshkov:
Comparison of Greedy Algorithms for Decision Tree Construction. KDIR 2011: 438-443 - [c4]Abdulaziz Alkhalid, Igor Chikalov, Mikhail Moshkov
Comparison of Greedy Algorithms for α-Decision Tree Construction. RSKT 2011: 178-186 - [c3]Abdulaziz Alkhalid, Igor Chikalov, Mikhail Moshkov
Constructing an Optimal Decision Tree for FAST Corner Point Detection. RSKT 2011: 187-194 - 2010
- [j1]Abdulaziz Alkhalid, Mohammad R. Alshayeb
Software refactoring at the function level using new Adaptive K-Nearest Neighbor algorithm. Adv. Eng. Softw. 41(10-11): 1160-1178 (2010) - [c2]Abdulaziz Alkhalid, Igor Chikalov, Mikhail Moshkov
On Algorithm for Building of Optimal alpha-Decision Trees. RSCTC 2010: 438-445 - [c1]Abdulaziz Alkhalid, Igor Chikalov, Mikhail Moshkov
A Tool for Study of Optimal Decision Trees. RSKT 2010: 353-360
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-25 05:54 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: