A Parallel Neural Networks Algorithm for the Clique Partitioning Problem by Harmanani, Haidar M.

“…The clique partitioning problem has important applications in many areas including VLSI design automation, scheduling, and resources allocation. In this paper we present a parallel algorithm to solve the above problem for arbitrary graphs using a Hopfield Neural Network model of computation. …”
Get full text
Get full text

A Neural Networks Algorithm for the Minimum Colouring Problem Using FPGAs† by Harmanani, Haidar

“…The proposed algorithm has a time complexity of O(1) for a neural network with n vertices and k colours. …”
Get full text
Get full text
Get full text

Sensitivity analysis and genetic algorithm-based shear capacity model for basalt FRC one-way slabs reinforced with BFRP bars by Abathar Al-Hamrani (16494884)

Deep Reinforcement Learning for Resource Constrained HLS Scheduling by Makhoul, Rim

“…The two main steps in HLS are: operations scheduling and data-path allocation. In this work, we present a resource constrained scheduling approach that minimizes latency and subject to resource constraints using a deep Q learning algorithm. …”
Get full text
Get full text
Get full text

A Novel BIPV Reconfiguration Algorithm for Maximum Power Generation under Partial Shading by Saoud A. Al-Janahi (18877213)

Prediction of EV Charging Behavior Using Machine Learning by Shahriar, Sakib

“…Using data-driven tools and machine learning algorithms to learn the EV charging behavior can improve scheduling algorithms. …”
Get full text

Brain Source Localization in the Presence of Leadfield Perturbations by Momin, Rabiya Nakhat

Get full text

Improved Jaya Synergistic Swarm Optimization Algorithm to Optimize Task Scheduling Problems in Cloud Computing by Abualigah, Laith

“…The Jaya algorithm's ability to exploit the current best solutions is complemented by the SSO's collaborative search strategy, resulting in a synergistic optimization framework. …”
Get full text

A Framework for Predictive Modeling in Sustainable Projects by Labban, Tarek

Get full text

MAESTRO: Orchestrating Computational Offloading to Multiple FemtoClouds in Various Communication Environments by Hend Gedawy (23275984)

“…For MAESTRO, we build an integrated architecture that includes two new scheduling algorithms for assigning computing workloads to FemtoClouds. …”

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

Maximal clique enumeration. (c2007) by Barghout, Hamed

Get full text
Get full text

A novel technique for fast multiplication by Sait, Sadiq M.

“…The algorithm is modelled in a hardware description language and its VLSI chip implemented. …”
Get full text

A novel technique for fast multiplication by Sait, Sadiq M.

“…The algorithms is modeled in a hardware description language and its VLSI chip implemented. …”
Get full text
Get full text

Machine Learning-Based Approach for EV Charging Behavior by Shahriar, Sakib

Get full text

A hybrid approach for XML similarity by Tekli, Joe

“…Owing to an unparalleled increasing use of the XML standard, developing efficient techniques for comparing XML-based documents becomes essential in information retrieval (IR) research. Various algorithms for comparing hierarchically structured data, e.g. …”
Get full text
Get full text
Get full text
Get full text

A new approach and faster exact methods for the maximum common subgraph problem by Abu-Khzam, Faisal N.

“…This structure contains a large number of naturally-ordered cliques that are present in the association graph’s complement. A detailed analysis shows that the proposed algorithm requires O((m+1)n) time, which is a superior worst-case bound to those known for previously-analyzed algorithms in the setting of the MCS problem. …”
Get full text
Get full text
Get full text
Get full text

Establishing Autonomous AUS-Quadrotor by Al Younes, Younes

Get full text

The maximum common subgraph problem by Abu-Khzam, Faisal N.

“…This is made possible by exploiting an efficient decomposition of a graph into a minimum vertex cover and the maximum independent set in its complement. The result is an algorithm whose run time is bounded by a function exponential in the order of the smaller cover rather than in the order of the smaller graph.…”
Get full text
Get full text
Get full text
Get full text

A Literature Review on System Dynamics Modeling for Sustainable Management of Water Supply and Demand by Khawar Naeem (17984062)

“…The solution approaches included the genetic algorithm (GA), particle swarm optimization (PSO), and the non-dominated sorting genetic algorithm (NSGA-II). …”