A kernelization algorithm for d-Hitting Set by Abu-Khzam, Faisal N.

“…For a given parameterized problem, π, a kernelization algorithm is a polynomial-time pre-processing procedure that transforms an arbitrary instance of π into an equivalent one whose size depends only on the input parameter(s). …”
Get full text
Get full text
Get full text

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

“…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 stochastic iterative learning control algorithm with application to an induction motor by Saab, Samer S.

“…A recursive optimal algorithm, based on minimizing the input error covariance matrix, is derived to generate the learning gain matrix of a P-type ILC for linear discrete-time varying systems with arbitrary relative degree. …”
Get full text
Get full text
Get full text
Get full text

Selection of the learning gain matrix of an iterative learning control algorithm in presence of measurement noise by Saab, Samer S.

“…This work also provides a recursive algorithm that generates the appropriate learning gain functions that meet the arbitrary high precision output tracking objective. …”
Get full text
Get full text
Get full text
Get full text

Fuzzy Logic Adaptive Crow Search Algorithm for MPPT of a Partially Shaded Photovoltaic System by Mohamed Ali Zeddini (22047920)

“…<p dir="ltr">The arbitrary selection of the Crow Search Algorithm (CSA) parameters, the Awareness Probability (AP) and the Flight Length (fl) results in poor convergence performance and efficiency even if the CSA performs well when solving global optimization problems. …”

An improved kernelization algorithm for r-Set Packing by Abu-Khzam, Faisal N.

“…Such parameterized reductions are known as kernelization algorithms, and a reduced instance is called a problem kernel. …”
Get full text
Get full text
Get full text

A method for the minimum coloring problem using genetic algorithms by Harmanani, Haidar

“…This paper presents a method to solve the graph coloring problem for arbitrary graphs using genetic algorithms. The graph coloring problem, an NP-hard problem, has important applications in many areas including time tabling and scheduling, frequency assignment, and reg ister allocation. …”
Get full text
Get full text
Get full text

Optimal selection of the forgetting matrix into an iterative learning control algorithm by Saab, Samer S.

“…A recursive optimal algorithm, based on minimizing the input error covariance matrix, is derived to generate the optimal forgetting matrix and the learning gain matrix of a P-type iterative learning control (ILC) for linear discrete-time varying systems with arbitrary relative degree. …”
Get full text
Get full text
Get full text
Get full text

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

“…This paper presents a hardware implementation to solve the graph colouring problem (chromatic number χ(G)) for arbitrary graphs using the Hopfield neural network (HNN) model of computation. …”
Get full text
Get full text
Get full text

Complexities of special matrix multiplication problems by Takche, J.

“…This paper develops optimal algorithms to multiply an n × n symmetric tridiagonal matrix by: (i) an arbitrary n × m matrix using 2nm − m multiplications; (ii) a symmetric tridiagonal matrix using 6n − 7 multiplications; and (iii) a tridiagonal matrix using 7n −8 multiplications. …”
Get full text
Get full text
Get full text
Get full text

A MIMO Sampling-Rate-Dependent Controller by Saab, Samer S.

“…The SRD controller aims at achieving uniform output tracking in the sense of attaining arbitrary small steady-state errors as well as arbitrary small settling time. …”
Get full text
Get full text
Get full text
Get full text

Fast, effective vertex cover kernelization by Abu-Khzam, F.N.

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

Learn while tracking. (c2013) by Toukhtarian, Raffi

Get full text
Get full text

Crown Structures for Vertex Cover Kernelization by Abu-Khzam, Faisal N.

“…Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discussed. …”
Get full text
Get full text
Get full text

The architecture of a highly reconfigurable RISC dataflow array processor by Sait, Sadiq M.

“…The array can be programmed to execute arbitrary algorithms in both static and dynamic manner. …”
Get full text

Morphology for Planar Hexagonal Modular Self-Reconfigurable Robotic Systems by Sadjadi, Hossein

Get full text

Metaheuristic Optimization‐Based Sliding Mode Control With Modified Perturb and Observe for Controlling MPPT of a PV Interfaced Grid Connected System by Anupama Ganguly (22502969)

“…Also, the proposed hybrid (MGO‐MPb&O) is compared with two other hybrid control topologies that are (PSO‐MPb&O) and (cuckoo search algorithm [CSA]‐MPb&O) in terms of maximum power extracted, efficiency, and convergence time of the objective function. …”

Learn while Tracking by Saab, Samer S.

“…Arbitrary small settling time along with arbitrary small steady-state output error are studied. …”
Get full text
Get full text
Get full text
Get full text

A quadratic kernel for 3-set packing by Abu-Khzam, Faisal N.

“…Such parameterized reductions are known as kernelization algorithms, and each reduced instance is called a problem kernel. …”
Get full text
Get full text
Get full text
Get full text

Efficient Seismic Volume Compression using the Lifting Scheme by Khene, M. F.

“…In addition, the lifting scheme offers: 1) a dramatic reduction of the required auxiliary memory, 2) an efficient combination with parallel rendering algorithms to perform arbitrary surface and volume rendering for interactive visualization, and 3) an easy integration in the parallel I/O seismic data loading routines. …”
Get full text