-
1
Optimal selection of the forgetting matrix into an iterative learning control algorithm
Published 2005“…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
article -
2
A Parallel Neural Networks Algorithm for the Clique Partitioning Problem
Published 2002“…A parallel simulator, based on PVM, was implemented for the proposed algorithm on a Linux Cluster. …”
Get full text
Get full text
article -
3
A stochastic iterative learning control algorithm with application to an induction motor
Published 2004“…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
article -
4
Fuzzy Logic Adaptive Crow Search Algorithm for MPPT of a Partially Shaded Photovoltaic System
Published 2024“…<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. …”
-
5
-
6
Learn while Tracking
Published 2007“…A simple non-iterative digital controller is proposed for the uniform output tracking problem of multi-input multi-output discrete-time varying linear systems with arbitrary relative degree. The proposed controller is based on fast sampling and computing. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
7
Shuffled Linear Regression with Erroneous Observations
Published 2019“…We propose an optimal recursive algorithm that updates the estimate from the underdetermined function that is based on that permutation-invariant constraint. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
8
An explicit finite-difference scheme for wave propagation in nonlinear optical structures
Published 2001“…The algorithm is an explicit nonlinear finite-difference method (NFDM) based on the exact solution of the nonlinear discrete equations. …”
article -
9
Morphology for Planar Hexagonal Modular Self-Reconfigurable Robotic Systems
Published 2009Get full text
doctoralThesis -
10
On the disk dimension of planar graphs
Published 2011“…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
conferenceObject -
11
-
12
Crown Structures for Vertex Cover Kernelization
Published 2007“…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
article -
13
Modelling of pollutant transport in compound open channels
Published 1998“…Derivation of the basic differential equations is based on the Navier-Stokes equations of continuity and fluid motion, in addition to the convection-dispersion equation. …”
Get full text
Get full text
masterThesis