Search alternatives:
complement complex » compliment compliment (Expand Search)
cosine algorithm » colony algorithm (Expand Search)
g algorithm » _ algorithms (Expand Search), rd algorithm (Expand Search)
element g » elements _ (Expand Search), clement k (Expand Search)
complement complex » compliment compliment (Expand Search)
cosine algorithm » colony algorithm (Expand Search)
g algorithm » _ algorithms (Expand Search), rd algorithm (Expand Search)
element g » elements _ (Expand Search), clement k (Expand Search)
-
1
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. …”
-
2
-
3
A Parallel Neural Networks Algorithm for the Clique Partitioning Problem
Published 2002“…Given a graph G = (V, E), a clique is a complete subgraph in G. …”
Get full text
Get full text
article -
4
-
5
Brain Source Localization in the Presence of Leadfield Perturbations
Published 2015Get full text
doctoralThesis -
6
-
7
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
-
8
Assessment of static pile design methods and non-linear analysis of pile driving
Published 2006“…The pile/soil interaction system is described by a mass/spring/dashpot system where the properties of each component are derived from rigorous analytical solutions or finite element analysis. The outcome of this research is an algorithm that can be used to predict pile displacement and driving stresses. …”
Get full text
Get full text
Get full text
masterThesis -
9
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 -
10
-
11
-
12
A hybrid approach for XML similarity
Published 2007“…Owing to an unparalleled increasing use of the XML standard, developing efficient techniques for comparing XML-based documents becomes essential in information retrieval (IR) research. Various algorithms for comparing hierarchically structured data, e.g. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
13
-
14
-
15
Multi-Modal Emotion Aware System Based on Fusion of Speech and Brain Information
Published 2019“…In all likelihood, while features from several modalities may enhance the classification performance, they might exhibit high dimensionality and make the learning process complex for the most used machine learning algorithms. …”
Get full text
Get full text
-
16
The Generalization of Bidirectional Dual Active Bridge DC/DC Converter Modulation Schemes: State-of-the-Art Analysis under Triple Phase Shift Control
Published 2023“…The article aims to highlight six TPS switching modes and their complements with operational constraints. Unlike previous studies that regarded TPS as a complex scheme, this paper simplifies the analysis of each mode and aims to standardize the understanding of TPS modulation for dual active bridge (DAB) converters. …”
-
17
Machine Learning Techniques for Pharmaceutical Bioinformatics
Published 2018“…The study integrates knowledge visualization, analysis, as well as development of a predictive model based on the Drug-Drug Interactions (DDIs) as a complex network. DDIs network analysis reveals unique drug features and explains unknown drug behaviors. …”
Get full text
-
18
Approximate XML structure validation based on document–grammar tree similarity
Published 2015“…In this paper, we propose an original method for measuring the structural similarity between an XML document and an XML grammar (DTD or XSD), considering their most common operators that designate constraints on the existence, repeatability and alternativeness of XML elements/attributes (e.g., ?, ∗, MinOccurs, MaxOccurs, etc.). …”
Get full text
Get full text
Get full text
Get full text
article -
19
-
20
Approximate XML structure validation technical report
Published 2014“…In this paper, we propose an original method for measuring the structural similarity between an XML document and an XML grammar (DTD or XSD), considering their most common operators that designate constraints on the existence, repeatability and alternativeness of XML elements/attributes (e.g., ?, *, MinOccurs, MaxOccurs, etc.). …”
Get full text
Get full text
Get full text
article