بدائل البحث:
modeling algorithm » scheduling algorithm (توسيع البحث)
using algorithm » cosine algorithm (توسيع البحث)
model algorithm » mould algorithm (توسيع البحث)
element » elements (توسيع البحث)
modeling algorithm » scheduling algorithm (توسيع البحث)
using algorithm » cosine algorithm (توسيع البحث)
model algorithm » mould algorithm (توسيع البحث)
element » elements (توسيع البحث)
-
61
-
62
Learning-Based Spectrum Sensing and Access for Cognitive Radio Systems
منشور في 2015احصل على النص الكامل
doctoralThesis -
63
AI-based remaining useful life prediction and modelling of seawater desalination membranes
منشور في 2024احصل على النص الكامل
doctoralThesis -
64
Cortical EEG Source Localization of Focal Epilepsy
منشور في 2017احصل على النص الكامل
doctoralThesis -
65
Augmented arithmetic optimization algorithm using opposite-based learning and lévy flight distribution for global optimization and data clustering
منشور في 2022"…This paper proposes a new data clustering method using the advantages of metaheuristic (MH) optimization algorithms. …"
-
66
Incremental and Heuristic Algorithms for Deriving Adaptive Distinguishing Test Cases for Nondeterministic Finite State Machines
منشور في 2017الموضوعات: "…Model Based Testing…"
احصل على النص الكامل
doctoralThesis -
67
-
68
-
69
A Parallel Neural Networks Algorithm for the Clique Partitioning Problem
منشور في 2002"…Our model uses a large number of simple processing elements or neurons, based on the McCulloch-Pitts binary neuron. …"
احصل على النص الكامل
احصل على النص الكامل
article -
70
A Hash-Based Assessment and Recovery Algorithm for Distributed Healthcare Systems Using Blockchain Technology
منشور في 2020"…Numerous damage assessment and recovery algorithms have been proposed in the literature. In this work, we present a distributed algorithm that uses blockchain technology and hash tables to solve the information warfare problem in healthcare systems. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
masterThesis -
71
Eye-Clustering: An Enhanced Centroids Prediction for K-means Algorithm
منشور في 2024"…Hundreds of such labeled graphs were used to train the model to predict the location of centroids. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
masterThesis -
72
Methodology for Analyzing the Traditional Algorithms Performance of User Reviews Using Machine Learning Techniques
منشور في 2020"…This conclusion was achieved after preprocessing a number of data values from these data sets.</p><h2>Other Information</h2><p dir="ltr">Published in: Algorithms<br>License: <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank">https://creativecommons.org/licenses/by/4.0/</a><br>See article on publisher's website: <a href="https://dx.doi.org/10.3390/a13080202" target="_blank">https://dx.doi.org/10.3390/a13080202</a></p>…"
-
73
-
74
-
75
Efficient Dynamic Cost Scheduling Algorithm for Data Batch Processing
منشور في 2016احصل على النص الكامل
doctoralThesis -
76
-
77
Web Based Online Hybrid Teaching Method of Network Music Course
منشور في 2022"…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. …"
احصل على النص الكامل
-
78
Properties of simulated annealing and genetic algorithms for mapping data to multicomputers
منشور في 1997"…Some user parameters are included in the objective function and are architecture- or problem-dependent parameters. The others are used in the GA and SA algorithms. The fault tolerance capability is demonstrated by mapping data to a multicomputer with some faulty processors. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
79
-
80
Correlation Clustering via s-Club Cluster Edge Deletion
منشور في 2023"…In certain situations, the requirement for clusters to be cliques was deemed excessively stringent, leading to the proposal of alternative relaxed clique models for dense subgraphs, such as s-club. In this work, we implement three approaches to tackle the 2-club clustering via edge deletion: a heuristic approach based on the influence of the edge to resolve maximum conflicts, a parameterized algorithm in which by deleting a maximum of k edges, the graph can be transformed into a 2-club cluster based on a branching algorithm, and the approach in Integer Linear Programming to find the optimized solution in an integer formulation. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
masterThesis