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

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. …”

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

“…We present a reduction procedure that takes an arbitrary instance of the 3-Set Packing problem and produces an equivalent instance whose number of elements is bounded by a quadratic function of the input parameter. …”
Get full text
Get full text
Get full text
Get full text

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

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 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

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

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.

“…In particular, this paper presents necessary and sufficient conditions for boundedness of trajectories and uniform tracking in presence of measurement noise and a class of random reinitialization errors for a simple ILC algorithm. The system under consideration is a class of discrete-time affine nonlinear systems with arbitrary relative degree and arbitrary number of system inputs and outputs. …”
Get full text
Get full text
Get full text
Get full text

Adaptive cooperative control of nonlinear multi-agent systems with uncertain time-varying control directions and dead-zone nonlinearity by Maryam Shahriari-kahkeshi (17269051)

“…<p dir="ltr">This paper investigates the development of an adaptive cooperative control scheme for the consensus of uncertain nonlinear multi-agent systems subjected to uncertain time-varying control direction, disturbances, and dead-zone nonlinearity. …”

An explicit finite-difference scheme for wave propagation in nonlinear optical structures by Al-Sunaidi, M. A.

“…In this paper, we present an algorithm that solves a time-domain nonlinear coupled system arising in nonlinear optics. …”

On the disk dimension of planar graphs by Abu-khzam, Faisal

“…More significantly, we devise a direct and highly practical linear-time algorithm to decide whether an arbitrary graph has fixed disk dimension k or less. …”
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 by Saab, Samer S.

“…The proposed controller is based on fast sampling and computing. 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

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

“…It is shown that the problem of finding an induced crown-free subgraph, and the problem of finding a crown of maximum size in an arbitrary graph, are solvable in polynomial time.…”
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

Learn while tracking. (c2013) by Toukhtarian, Raffi

Get full text
Get full text

Modelling of pollutant transport in compound open channels by Chatila, Jean Georges

“…These equations are derived in three dimensions (3-D), however, in order to simplify the problem and ease the computational effort, the equations are integrated over the depth (depth-averaged). …”
Get full text
Get full text