Search alternatives:
method algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
regulating » regulations (Expand Search), regulation (Expand Search)
method algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
regulating » regulations (Expand Search), regulation (Expand Search)
-
101
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 -
102
Fuzzy Logic Adaptive Crow Search Algorithm for MPPT of a Partially Shaded Photovoltaic System
Published 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. …”
-
103
Improved Reptile Search Algorithm by Salp Swarm Algorithm for Medical Image Segmentation
Published 2023“…This study proposes a novel nature-inspired meta-heuristic optimizer based on the Reptile Search Algorithm combed with Salp Swarm Algorithm for image segmentation using gray-scale multi-level thresholding, called RSA-SSA. …”
Get full text
-
104
Web Based Online Hybrid Teaching Method of Network Music Course
Published 2022“…In the context of big data, the lengthy personalized screening process of users has become one of the problems to be solved. Based on Web data mining, an improved algorithm of hybrid hierarchical recommendation algorithm and genetic algorithm is used in the experiment, and compared with the other two algorithms in the experiment. …”
Get full text
-
105
-
106
-
107
Transformations for Variants of the Travelling Salesman Problem and Applications
Published 2017Get full text
doctoralThesis -
108
-
109
Complexities of special matrix multiplication problems
Published 1988Get full text
Get full text
Get full text
Get full text
article -
110
Parallel implementation of clique partitioning using artificial neural networks. (c2000)
Published 2000Get full text
Get full text
masterThesis -
111
Haplotype inference by pure-parsimony using revamped delayed haplotype selection. (c2011)
Published 2011Get full text
Get full text
masterThesis -
112
The multi-parameterized cluster editing problem
Published 2017Get full text
Get full text
Get full text
Get full text
conferenceObject -
113
Incremental Genetic Algorithm
Published 2006“…If these problems are not small in size, it becomes costly to use a genetic algorithm to reoptimize them after each modification. …”
Get full text
Get full text
article -
114
-
115
Augmented arithmetic optimization algorithm using opposite-based learning and lévy flight distribution for global optimization and data clustering
Published 2022“…This paper proposes a new data clustering method using the advantages of metaheuristic (MH) optimization algorithms. …”
-
116
-
117
Minimizing using BBO and DFO methods
Published 2022“…In [1], Nour and Zeidan proposed a numerical algorithm to solve optimal control problems involving sweeping processes. …”
Get full text
Get full text
Get full text
masterThesis -
118
Arabic Text Classification Using Modified Artificial Bee Colony Algorithm for Sentiment Analysis: The Case of Jordanian Dialect
Published 2022“…The second phase, modified the Artificial Bee Colony (ABC) Algorithm, with Upper Confidence Bound (UCB) Algorithm, to promote the exploitation ability for the minimum dimension, to get the minimum number of the optimal feature, then using forward feature selection strategy by four classifiers of machine learning algorithms: (K-Nearest Neighbors (KNN), Support vector machines (SVM), Naïve-Bayes (NB), and Polynomial Neural Networks (PNN). …”
Get full text
-
119
-
120
On the parameterized parallel complexity and the vertex cover problem
Published 2016“…We initiate the study of FPPT with the well-known k-vertex cover problem. In particular, we present a parallel algorithm that outperforms the best known parallel algorithm for this problem: using O(m) instead of O(n2) parallel processors, the running time improves from 4logn+O(kk) to O(k⋅log3n) , where m is the number of edges, n is the number of vertices of the input graph, and k is an upper bound of the size of the sought vertex cover. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject