A hybrid graph representation for exact graph algorithms by Abu-Khzam, Faisal N.

“…We investigate practical implementation-based aspects of exact graph algorithms by providing a simple hybrid graph representation that trades space for time to address the said take-back challenge. …”
Get full text
Get full text
Get full text

A hybrid graph representation for recursive backtracking algorithms by Abu-Khzam, Faisal N.

“…The use of efficient data structures is necessary for fast graph modification modules as well as fast take-back procedures. In this paper, we investigate practical implementation-based aspects of exact algorithms by providing a hybrid graph representation that addresses the take-back challenge and combines the advantage of O(1)O(1) adjacency-queries in adjacency-matrices with the advantage of efficient neighborhood traversal in adjacency-lists.…”
Get full text
Get full text
Get full text
Get full text

Social spider optimization algorithm: survey and new applications by Abualigah, Laith

“…This algorithm has been developed over time, resulting in many versions besides theories and findings. …”
Get full text

The effects of data balancing approaches: A case study by Paul Mooijman (4453189)

“…In this research, classification algorithms, combined with resampling strategies and dimensionality reduction methods, were investigated to find a prediction model to correctly identify the samples of treated animals. …”

Application of Data Mining to Predict and Diagnose Diabetic Retinopathy by Haniyeh, Maryam

Get full text

Block constrained pressure residual preconditioning for two-phase flow in porous media by mixed hybrid finite elements by Stefano Nardean (14151900)

“…<p dir="ltr">This work proposes an original preconditioner that couples the Constrained Pressure Residual (CPR) method with block preconditioning for the efficient solution of the linearized systems of equations arising from fully implicit multiphase flow models. …”

A Scatter search algorithm for exam scheduling. (c2006) by Isahakian, Vatche Raffi

Get full text
Get full text

Correlation Clustering via s-Club Cluster Edge Deletion by Makarem, Norma

Get full text
Get full text
Get full text

Indexing Arabic texts using association rule data mining by Haraty, Ramzi A.

“…The model denotes extracting new relevant words by relating those chosen by previous classical methods to new words using data mining rules. Design/methodology/approach The proposed model uses an association rule algorithm for extracting frequent sets containing related items – to extract relationships between words in the texts to be indexed with words from texts that belong to the same category. …”
Get full text
Get full text
Get full text
Get full text

Interval-Valued SVM Based ABO for Fault Detection and Diagnosis of Wind Energy Conversion Systems by Majdi Mansouri (16869885)

“…The proposals will enhance the monitoring and diagnosis of the WEC system while taking into account the system uncertainties. The developed techniques are based on Support Vector Machine (SVM) model to improve the diagnosis of WEC systems. …”

A fast exact sequential algorithm for the partial digest problem by Mostafa M. Abbas (17058093)

“…Two types of simulated data, random and Zhang, are used to measure the efficiency of the algorithm. …”

Use of Data Mining Techniques to Detect Fraud in Procurement Sector by AL HAMMADI, SUMAYYA ABDULLA

“…The method used in this research is a classification of models and algorithms used in data mining. All techniques also will be studied; they include clustering, tracking patterns, classifications and outlier detection. …”
Get full text

Predicting Patient ICU Readmission Using Recurrent Neural Networks With Long Short-Term Memory by Nadia Rasheed (22997257)

A method for optimizing test bus assignment and sizing for system-on-a-chip by Harmanani, Haidar M.

“…Test access mechanism (TAM) is an important element of test access architectures for embedded cores and is responsible for on-chip test patterns transport from the source to the core under test to the sink. …”
Get full text
Get full text
Get full text
Get full text

Assessment of static pile design methods and non-linear analysis of pile driving by Abou-Jaoude, Grace G.

“…The pile/soil interaction system is described by a mass/spring/dashpot system where the properties of each component are derived from rigorous analytical solutions or finite element analysis. The outcome of this research is an algorithm that can be used to predict pile displacement and driving stresses. …”
Get full text
Get full text
Get full text

Evolutionary algorithms for state justification in sequential automatic test pattern generation by El-Maleh, Aiman H.

“…A common search operation in sequential Automatic Test Pattern Generation is to justify a desired state assignment on the sequential elements. State justification using deterministic algorithms is a difficult problem and is prone to many backtracks, which can lead to high execution times. …”
Get full text

Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks by Abu-Khzam, Faisal N.

“…We present a first distributed approximation algorithm for this problem. The algorithm achieves a constant approximation ratio if the ratio of the maximum transmission range over the minimum transmission range in the network is bounded and takes O(Diam) rounds, where Diam is the diameter of the graph. …”
Get full text
Get full text
Get full text
Get full text

Matheuristic Fixed Set Search Applied to the Two-Stage Capacitated Facility Location Problem by Denis Alicic (23073484)

The unified effect of data encoding, ansatz expressibility and entanglement on the trainability of HQNNs by Muhammad Kashif (3923483)

“…One of the prominent challenges lies in the presence of barren plateaus (BP) in QML algorithms, particularly in quantum neural networks (QNNs). …”

A data envelopment analysis model for opinion leaders’ identification in social networks by Hamed Baziyad (19273738)

“…The graph-based methods are one of the most important approaches for finding OLs in OSNs. Social Network Analysis (SNA)-based OLs finding methods deal with a considerable amount of data due to using entire relationships between all of the users in a network, which makes the algorithms time-consuming. …”