On scalable parallel recursive backtracking by Abu-Khzam, Faisal N.

“…Solving NP-hard graph problems to optimality using exact algorithms is an example of an area in which there has so far been limited success in obtaining large scale parallelism. …”
Get full text
Get full text
Get full text

An Evolutionary Meta-Heuristic for State Justification in Sequential Automatic Test Pattern Generation by El-Maleh, Aiman H.

“…A common search optimization in sequential ATPG 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

An evolutionary meta-heuristic for state justification insequential automatic test pattern generation by El-Maleh, A.H.

“…A common search operation in sequential ATPG 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
Get full text

A Robust Deep Learning Approach for Distribution System State Estimation with Distributed Generation by Kfouri, Ronald

“…The algorithms are tested on three different networks. The proposed approach solves the DSSE problem with limited measurements as inputs, which cannot be solved using conventional state estimation methods. …”
Get full text
Get full text
Get full text

Corona power loss computation in bundled bipolar conductors by Al-Hamouz, Z.M.

“…In this paper, a finite element (FE) based algorithm devoted for the computation of the corona current and hence the corona power loss associated with bundled bipolar high voltage direct current (HVDC) conductors is presented. …”
Get full text
Get full text

A linear programming approach for the weighted graph matchingproblem by Almohamad, H.A.

“…The linear program is solved using a simplex-based algorithm. Then, approximate 0-1 integer solutions are obtained by applying the Hungarian method on the real solutions of the linear program. …”
Get full text
Get full text

Practical Multiple Node Failure Recovery in Distributed Storage Systems by Itani, M.

“…We allocate newcomers to nodes with minimal computations and without changing the original optimized plan. The problem is solved using genetic algorithms that search within the feasible solution space. …”
Get full text
Get full text
Get full text
Get full text

A LINEAR-PROGRAMMING APPROACH FOR THE WEIGHTED GRAPH MATCHING PROBLEM by Al-Mohamad, HA

“…The linear program is solved using a Simplex-based algorithm. Then, approximate 0-1 integer solutions are obtained by applying the Hungarian method on the real solutions of the linear program. …”
Get full text

Power system output feedback stabilizer design via geneticalgorithms by Abdel-Magid, Y.L.

“…The paper demonstrates the use of genetic algorithms to design output feedback power system stabilizers. …”
Get full text
Get full text

Machine Learning Solutions for the Security of Wireless Sensor Networks: A Review by Yazeed Yasin Ghadi (16667109)

“…The main objective of the article is to know about different machine learning algorithms that are used to solve the security issues of wireless sensor networks. …”

Multi-Classifier Tree With Transient Features for Drift Compensation in Electronic Nose by Atiq Ur Rehman (8843024)

“…In this paper, these two problems of `sensors long term drift' and `delayed response' are solved simultaneously to propose a robust and fast electronic nose system, with following merits: (i) only initial transient state features are used in the proposed system without waiting for the sensors to reach a steady state, (ii) a modified boxplot approach is used to handle noisy/drifted data points as a preprocessing step before the classification setup, (iii) a heuristic tree classification approach with optimized transient features is proposed, (iv) the proposed approach only relies on adapted ML methods contrary to the traditional approaches like system recalibration or sensors replacement for handling sensors drift, and (v) the proposed ML model does not require any target domain data and uses only the source domain data for learning the classifier, opposed to the other ML solutions available in the existing literature. …”

Simulations of the penetration of 6061-T6511 aluminum targets by spherical-nosed VAR 4340 steel projectiles by Warren, Thomas

“…In the context of an analysis code, this approximation eliminates the need for discretizing the target as well as the need for a contact algorithm. Thus, this method substantially reduces the computer time and memory requirements. …”
Get full text
Get full text
Get full text

Unit commitment by tabu search by Mantawy, A.H.

“…The problem is divided into two subproblems: a combinatorial optimisation problem and a nonlinear programming problem. The former is solved using the tabu search algorithm (TSA) while the latter problem is solved via a quadratic programming routine. …”
Get full text
Get full text

Vibration suppression in a cantilever beam using a string-type vibration absorber by Issa, Jimmy S.

“…The string is rigidly connected to the fixed end of the beam and through a spring and damper to a second point on the beam. The finite element method is used to model the system and a reduced order model is obtained through modal reduction performed on both the string and the beam. …”
Get full text
Get full text
Get full text
Get full text

Dynamic multiple node failure recovery in distributed storage systems by Itani, May

“…The contribution of this paper is four-fold: i. we generate an optimized block distribution scheme that minimizes the total system repair cost of all dependent and independent multiple node failure scenarios; ii. we address the practical scenario of having newly arriving blocks and allocate those blocks to existing nodes without any modification to the original on-node block distribution; iii. we consider new-comer nodes and generate an updated optimized block distribution; iv. we consider optimized storage and recovery of blocks with varying priority using variable fractional repetition codes. The four problems are modeled using incidence matrices and solved heuristically. …”
Get full text
Get full text
Get full text
Get full text

Deep Neural Networks for Electromagnetic Inverse Scattering Problems in Microwave Imaging by Maricar, Mohammed Farook

Get full text

Methods for system-on-chip test design, scheduling and optimization. (c2006) by Farah, Rana

Get full text
Get full text

Transformations for Variants of the Travelling Salesman Problem and Applications by Assaf, Mustafa Jamil

Get full text

On the complexity of multi-parameterized cluster editing by Abu-Khzam, Faisal

Get full text
Get full text
Get full text
Get full text

Application of Metastructures for Targeted Low-Frequency Vibration Suppression in Plates by Ratiba F. Ghachi (14152455)

“…The thin plate and the zigzag cutouts are modelled using the finite element method, and the optimal location and optimal tip mass of the zigzag cutouts are obtained using genetic algorithms through iterative simulations. …”