-
1
An improved kernelization algorithm for r-Set Packing
Published 2010“…We present a reduction procedure that takes an arbitrary instance of the r -Set Packing problem and produces an equivalent instance whose number of elements is in O(kr−1), where k is the input parameter. …”
Get full text
Get full text
Get full text
article -
2
A Parallel Neural Networks Algorithm for the Clique Partitioning Problem
Published 2002“…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
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
A Neural Networks Algorithm for the Minimum Colouring Problem Using FPGAs†
Published 2010“…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
article -
5
Selection of the learning gain matrix of an iterative learning control algorithm in presence of measurement noise
Published 2005“…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
article -
6
Shuffled Linear Regression with Erroneous Observations
Published 2019“…Although our algorithm is sensitive to initialization errors, to the best of our knowledge, the resulting method is the first working solution for arbitrary large dimensions and arbitrary large observation errors while its computation throughput appears insignificant. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
7
-
8
Morphology for Planar Hexagonal Modular Self-Reconfigurable Robotic Systems
Published 2009Get full text
doctoralThesis -
9
Metaheuristic Optimization‐Based Sliding Mode Control With Modified Perturb and Observe for Controlling MPPT of a PV Interfaced Grid Connected System
Published 2025“…The suggested approach looks for every maximum point across a lengthy number of cycles to find the global maximum point after introducing (MGO‐MPb&O), and the results of the MATLAB/Simulink show that the algorithm performs well under the arbitrary changes of the physical parameters of the proposed system and ambient scenario. …”
-
10
A quadratic kernel for 3-set packing
Published 2017“…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
conferenceObject -
11
Using C++ to Calculate SO(10) Tensor Couplings
Published 2021“…The software is capable of accepting invariant couplings involving an arbitrary number of SO(10) Higgs tensors, each having up to five indices. …”
Get full text
article