A kernelization algorithm for d-Hitting Set حسب 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). …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

A Parallel Neural Networks Algorithm for the Clique Partitioning Problem حسب Harmanani, Haidar M.

احصل على النص الكامل
احصل على النص الكامل

A stochastic iterative learning control algorithm with application to an induction motor حسب 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Selection of the learning gain matrix of an iterative learning control algorithm in presence of measurement noise حسب 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Fuzzy Logic Adaptive Crow Search Algorithm for MPPT of a Partially Shaded Photovoltaic System حسب 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. …"

Shuffled Linear Regression with Erroneous Observations حسب Saab, Samer S.

احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Complexities of special matrix multiplication problems حسب 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Fast, effective vertex cover kernelization حسب Abu-Khzam, F.N.

احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

A MIMO Sampling-Rate-Dependent Controller حسب 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Morphology for Planar Hexagonal Modular Self-Reconfigurable Robotic Systems حسب Sadjadi, Hossein

احصل على النص الكامل

Metaheuristic Optimization‐Based Sliding Mode Control With Modified Perturb and Observe for Controlling MPPT of a PV Interfaced Grid Connected System حسب 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. …"

On the disk dimension of planar graphs حسب 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

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

"…Simulation and comparison results demonstrate the effectiveness of the proposed algorithm.</p><h2>Other Information</h2><p dir="ltr">Published in: Neurocomputing<br>License: <a href="http://creativecommons.org/licenses/by/4.0/" target="_blank">http://creativecommons.org/licenses/by/4.0/</a><br>See article on publisher's website: <a href="https://dx.doi.org/10.1016/j.neucom.2021.08.065" target="_blank">https://dx.doi.org/10.1016/j.neucom.2021.08.065</a></p>…"

Crown Structures for Vertex Cover Kernelization حسب 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Efficient Seismic Volume Compression using the Lifting Scheme حسب 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. …"
احصل على النص الكامل

Modelling of pollutant transport in compound open channels حسب Chatila, Jean Georges

"…This is examined through developing a 2-D finite difference mathematical model, (CHAT: Compound-channel Hydraulics And Transport), to solve the flow and transport equations for open channels having compound cross-sections. …"
احصل على النص الكامل
احصل على النص الكامل