Search alternatives:
modeling algorithm » scheduling algorithm (Expand Search)
method algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
data modeling » data models (Expand Search), spatial modeling (Expand Search)
element » elements (Expand Search)
modeling algorithm » scheduling algorithm (Expand Search)
method algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
data modeling » data models (Expand Search), spatial modeling (Expand Search)
element » elements (Expand Search)
-
181
Cyberbullying Detection Model for Arabic Text Using Deep Learning
Published 2023“…As a result of the models’ evaluation, a hybrid DL model is proposed that combines the best characteristics of the baseline models CNN, BLSTM and GRU for identifying cyberbullying. …”
Get full text
Get full text
-
182
-
183
Transformations for Variants of the Travelling Salesman Problem and Applications
Published 2017Get full text
doctoralThesis -
184
-
185
-
186
Complexities of special matrix multiplication problems
Published 1988Get full text
Get full text
Get full text
Get full text
article -
187
Prediction of EV Charging Behavior Using Machine Learning
Published 2021“…Using data-driven tools and machine learning algorithms to learn the EV charging behavior can improve scheduling algorithms. …”
Get full text
article -
188
Parallel implementation of clique partitioning using artificial neural networks. (c2000)
Published 2000Get full text
Get full text
masterThesis -
189
Haplotype inference by pure-parsimony using revamped delayed haplotype selection. (c2011)
Published 2011Get full text
Get full text
masterThesis -
190
The multi-parameterized cluster editing problem
Published 2017Get full text
Get full text
Get full text
Get full text
conferenceObject -
191
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 -
192
Label dependency modeling in Multi-Label Naïve Bayes through input space expansion
Published 2024“…To accommodate the heterogeneity of the expanded input space, we refine the likelihood parameters of iMLNB using a joint density function, which is adept at handling the amalgamation of data types. We subject our enhanced iMLNB model to a rigorous empirical evaluation, utilizing six benchmark datasets. …”
-
193
-
194
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. …”
-
195
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 -
196
Information reconciliation through agent controlled graph model. (c2018)
Published 2018“…Multiple models have been proposed and different techniques and data structures were used. …”
Get full text
Get full text
Get full text
masterThesis -
197
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
-
198
-
199
-
200
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