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.

"…In this paper we present a parallel algorithm to solve the above problem for arbitrary graphs using a Hopfield Neural Network model of computation. …"
احصل على النص الكامل
احصل على النص الكامل

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.

"…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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

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

Optimal selection of the forgetting matrix into an iterative learning control algorithm حسب 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

A method for the minimum coloring problem using genetic algorithms حسب 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

A Neural Networks Algorithm for the Minimum Colouring Problem Using FPGAs† حسب Harmanani, Haidar

"…The proposed algorithm has a time complexity of O(1) for a neural network with n vertices and k colours. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

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

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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

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

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

Learn while Tracking حسب 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

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

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

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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Learn while tracking. (c2013) حسب Toukhtarian, Raffi

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

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

"…The numerical computation of open-channel flows requires preparing and processing larger volumes of boundary and bathymetry data for computer inputs and the development of numerical algorithms for treating complex boundary condition, channel properties, and free surface effects. …"
احصل على النص الكامل
احصل على النص الكامل

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

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