-
1
A kernelization algorithm for d-Hitting Set
منشور في 2010"…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). …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
2
An improved kernelization algorithm for r-Set Packing
منشور في 2010"…Such parameterized reductions are known as kernelization algorithms, and a reduced instance is called a problem kernel. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
3
Optimal selection of the forgetting matrix into an iterative learning control algorithm
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
4
A method for the minimum coloring problem using genetic algorithms
منشور في 2006"…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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
5
A Parallel Neural Networks Algorithm for the Clique Partitioning Problem
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
article -
6
A Neural Networks Algorithm for the Minimum Colouring Problem Using FPGAs†
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
7
A stochastic iterative learning control algorithm with application to an induction motor
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
8
Selection of the learning gain matrix of an iterative learning control algorithm in presence of measurement noise
منشور في 2005"…This work also provides a recursive algorithm that generates the appropriate learning gain functions that meet the arbitrary high precision output tracking objective. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
9
Fuzzy Logic Adaptive Crow Search Algorithm for MPPT of a Partially Shaded Photovoltaic System
منشور في 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. …"
-
10
Learn while Tracking
منشور في 2007"…Arbitrary small settling time along with arbitrary small steady-state output error are studied. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
11
Shuffled Linear Regression with Erroneous Observations
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
12
An explicit finite-difference scheme for wave propagation in nonlinear optical structures
منشور في 2001"…In this paper, we present an algorithm that solves a time-domain nonlinear coupled system arising in nonlinear optics. …"
article -
13
A MIMO Sampling-Rate-Dependent Controller
منشور في 2014"…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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
14
-
15
Morphology for Planar Hexagonal Modular Self-Reconfigurable Robotic Systems
منشور في 2009احصل على النص الكامل
doctoralThesis -
16
Metaheuristic Optimization‐Based Sliding Mode Control With Modified Perturb and Observe for Controlling MPPT of a PV Interfaced Grid Connected System
منشور في 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. …"
-
17
Complexities of special matrix multiplication problems
منشور في 1988"…Efficient algorithms are also developed to multiply a tridiagonal matrix by an arbitrary matrix, and to multiply two tridiagonal matrices.…"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
18
On the disk dimension of planar graphs
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
19
Adaptive cooperative control of nonlinear multi-agent systems with uncertain time-varying control directions and dead-zone nonlinearity
منشور في 2021"…Stability analysis shows that all signals of the closed-loop multi-agent system are semi-globally uniformly ultimately bounded and the consensus error can be made arbitrary small by the proper selection of design parameters. …"
-
20
