Search alternatives:
cosine algorithm » colony algorithm (Expand Search)
multi algorithm » mould algorithm (Expand Search), auction algorithm (Expand Search)
complement i » comovement _ (Expand Search)
i algorithm » _ algorithms (Expand Search), rd algorithm (Expand Search)
element » elements (Expand Search)
cosine algorithm » colony algorithm (Expand Search)
multi algorithm » mould algorithm (Expand Search), auction algorithm (Expand Search)
complement i » comovement _ (Expand Search)
i algorithm » _ algorithms (Expand Search), rd algorithm (Expand Search)
element » elements (Expand Search)
-
1
-
2
Effective uncertain fault diagnosis technique for wind conversion systems using improved ensemble learning algorithm
Published 2023“…<p>This paper introduces a pioneering fault diagnosis technique termed Interval Ensemble Learning based on Sine Cosine Optimization Algorithm (IEL- SCOA), tailored to tackle uncertainties prevalent in wind energy conversion (WEC) systems. …”
-
3
Extended Behavioral Modeling of FET and Lattice-Mismatched HEMT Devices
Published 2016Subjects: Get full text
doctoralThesis -
4
Multi-Objective Optimisation of Injection Moulding Process for Dashboard Using Genetic Algorithm and Type-2 Fuzzy Neural Network
Published 2024“…Its purpose was to estimate shear and residual stress levels. Additionally, the multi-objective genetic algorithm (MOGA) was utilised to extract the most optimal parameters for the injection moulding process, aiming to minimise shear and residual stress and thereby increase the resistance of the final product. …”
-
5
Enhancing Breast Cancer Diagnosis With Bidirectional Recurrent Neural Networks: A Novel Approach for Histopathological Image Multi-Classification
Published 2025“…In this study, we introduce an innovative method for the multi-classification of breast cancer histopathological images utilizing Bidirectional Recurrent Neural Networks (BRNN). …”
-
6
On the complexity of multi-parameterized cluster editing
Published 2017“…As a byproduct, we obtain a kernelization algorithm that delivers linear-size kernels when the two edge-edit bounds are small constants.…”
Get full text
Get full text
Get full text
Get full text
article -
7
Optimization of Commercially Off the Shelf (COTS) Electric Propulsion System for Low Speed Fuel Cell UAV
Published 2013Get full text
doctoralThesis -
8
Efficient unified Montgomery inversion with multi-bit shifting
Published 2005“…They also propose a hardware structure where the field elements are represented using a multi-word format. …”
Get full text
Get full text
article -
9
Analysis of Multi-User-Based UAV System With Outdated CSI
Published 2024“…Optimization of UAV location and altitude is performed through a limited-memory Broyden-Fletcher-Goldfarb-Shanno (LBFGS) algorithm to attain minimum OP (MOP). Results illustrate optimal performance dependent on the channel correlation parameters, antenna elements, and fading conditions. …”
-
10
-
11
Improved Jaya Synergistic Swarm Optimization Algorithm to Optimize Task Scheduling Problems in Cloud Computing
Published 2024“…The Jaya algorithm's ability to exploit the current best solutions is complemented by the SSO's collaborative search strategy, resulting in a synergistic optimization framework. …”
Get full text
-
12
Socially Motivated Approach to Simulate Negotiation Process
Published 2014Get full text
doctoralThesis -
13
-
14
Correlation Clustering with Overlaps
Published 2020“…We present a heuristic algorithm and a semi-exact algorithm for the Multi-Parameterized Cluster Editing with Vertex Splitting problem. …”
Get full text
Get full text
Get full text
masterThesis -
15
-
16
-
17
A novel technique for fast multiplication
Published 2020“…The algorithm is modelled in a hardware description language and its VLSI chip implemented. …”
Get full text
article -
18
A novel technique for fast multiplication
Published 1995“…The algorithms is modeled in a hardware description language and its VLSI chip implemented. …”
Get full text
Get full text
article -
19
A new approach and faster exact methods for the maximum common subgraph problem
Published 2017“…This structure contains a large number of naturally-ordered cliques that are present in the association graph’s complement. A detailed analysis shows that the proposed algorithm requires O((m+1)n) time, which is a superior worst-case bound to those known for previously-analyzed algorithms in the setting of the MCS problem. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
20