Search alternatives:
method algorithm » mould algorithm (Expand Search)
data algorithm » jaya algorithm (Expand Search), deer algorithm (Expand Search)
element » elements (Expand Search)
finding » findings (Expand Search)
method algorithm » mould algorithm (Expand Search)
data algorithm » jaya algorithm (Expand Search), deer algorithm (Expand Search)
element » elements (Expand Search)
finding » findings (Expand Search)
-
41
Design of adaptive arrays based on element position perturbations
Published 1993“…The main advantage of using this technique over the other commonly used methods is that the amplitudes and phases of the array elements can be used mainly to steer the main beam towards the desired signal. …”
Get full text
Get full text
article -
42
Improved Transportation Model with Internet of Things Using Artificial Intelligence Algorithm
Published 2023“…Furthermore, a route management technique is combined with Artificial Intelligence (AI) algorithm to transmit the data to appropriate central servers. …”
-
43
A decentralized load balancing strategy for parallel search-three optimization. (c2010)
Published 2010Get full text
Get full text
masterThesis -
44
Topics in graph algorithms
Published 2003“…This is achieved by implementing some algorithms for the vertex cover problem, and conducting experiments on real data sets. …”
Get full text
Get full text
Get full text
masterThesis -
45
-
46
-
47
-
48
An enhanced quorum selection algorithm
Published 2009Get full text
Get full text
Get full text
article -
49
An Improved Quorum Selection Algorithm
Published 2008Get full text
Get full text
Get full text
Get full text
conferenceObject -
50
Correlation Clustering with Overlaps
Published 2020“…Moreover, we allow the new vertex splitting operation, which allows the resulting clusters to overlap. In other words, data elements (or vertices) will be allowed to be members in more than one cluster instead of limiting them to only one single cluster, as in classical clustering methods. …”
Get full text
Get full text
Get full text
masterThesis -
51
Robust Control Of Sampled Data Systems
Published 2020“…The authors present robust stability bounds for sampled data systems. …”
Get full text
article -
52
Robust control of sampled data systems
Published 1998“…The authors present robust stability bounds for sampled data systems. …”
Get full text
Get full text
article -
53
Robust Control Of Sampled Data Systems
Published 2020“…The authors present robust stability bounds for sampled data systems. …”
Get full text
article -
54
Robust Control Of Sampled Data Systems
Published 2020“…The authors present robust stability bounds for sampled data systems. …”
Get full text
article -
55
Oversampling techniques for imbalanced data in regression
Published 2024“…For such high-dimension data our approach outperforms the Synthetic Minority Oversampling Technique for Regression (SMOTER) algorithm for the IMDB-WIKI and AgeDB image datasets. …”
-
56
-
57
Data Redundancy Management in Connected Environments
Published 2020“…., building) equipped with sensors that produce and exchange raw data. Although the sensed data is considered to contain useful and valuable information, yet it might include various inconsistencies such as data redundancies, anomalies, and missing values. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
58
Unsupervised outlier detection in multidimensional data
Published 2022“…<p>Detection and removal of outliers in a dataset is a fundamental preprocessing task without which the analysis of the data can be misleading. Furthermore, the existence of anomalies in the data can heavily degrade the performance of machine learning algorithms. …”
-
59
Graph Contraction for Mapping Data on Parallel Computers
Published 1994“…The mapping solution for the original problem is obtained by a straightforward interpolation. We then present experimental results on using contracted graphs as inputs to two physical optimization methods; namely, genetic algorithm and simulated annealing. …”
Get full text
Get full text
Get full text
article -
60
Mapping realistic data sets on parallel computers
Published 1993“…The authors propose reducing the problem size by a mapping-oriented graph contraction technique. They present a graph contraction (GC) heuristic algorithm that yields a smaller representation of the problem, to which mapping is then applied. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject