Search alternatives:
developing based » developing a (Expand Search), developing 21st (Expand Search)
using algorithm » cosine algorithm (Expand Search)
mold algorithm » mould algorithm (Expand Search), rd algorithm (Expand Search), colony algorithm (Expand Search)
developing based » developing a (Expand Search), developing 21st (Expand Search)
using algorithm » cosine algorithm (Expand Search)
mold algorithm » mould algorithm (Expand Search), rd algorithm (Expand Search), colony algorithm (Expand Search)
-
41
Methodology for Analyzing the Traditional Algorithms Performance of User Reviews Using Machine Learning Techniques
Published 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>…”
-
42
-
43
Efficient Dynamic Cost Scheduling Algorithm for Data Batch Processing
Published 2016Get full text
doctoralThesis -
44
Properties of simulated annealing and genetic algorithms for mapping data to multicomputers
Published 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. …”
Get full text
Get full text
Get full text
article -
45
Physical optimization algorithms for mapping data to distributed-memory multiprocessors
Published 1992“…We present three parallel physical optimization algorithms for mapping data to distributed-memory multiprocessors, concentrating on irregular loosely synchronous problems. …”
Get full text
Get full text
Get full text
masterThesis -
46
General applicability of genetic and simulated annealing algorithms for data mapping
Published 1995Get full text
Get full text
Get full text
conferenceObject -
47
A Hybrid Intrusion Detection Model Using EGA-PSO and Improved Random Forest Method
Published 2022“…To deal with the data-imbalance issue, this research develops an efficient hybrid network-based IDS model (HNIDS), which is utilized using the enhanced genetic algorithm and particle swarm optimization(EGA-PSO) and improved random forest (IRF) methods. …”
-
48
Novel Peak Detection Algorithms for Pileup Minimization in Gamma Ray Spectroscopy
Published 2006“…A number of parameter estimation and digital online peak localisation algorithms are being developed, including a pulse classification technique which uses a simple peak search routine based on the smoothed first derivative method, which gave a percentage error of peak amplitude of less than 1%. …”
Get full text
Get full text
article -
49
A Genetic Algorithm for Improving Accuracy of Software Quality Predictive Models
Published 2010“…In this work, we present a genetic algorithm to optimize predictive models used to estimate software quality characteristics. …”
Get full text
Get full text
Get full text
article -
50
-
51
-
52
-
53
A comparison of data mapping algorithms for parallel iterative PDE solvers
Published 1995“…We review and evaluate the performances of six data mapping algorithms used for parallel single-phase iterative PDE solvers with irregular 2-dimensional meshes on multicomputers. …”
Get full text
Get full text
Get full text
article -
54
An enhanced k-means clustering algorithm for pattern discovery in healthcare data
Published 2015“…This paper studies data mining applications in healthcare. Mainly, we study k-means clustering algorithms on large datasets and present an enhancement to k-means clustering, which requires k or a lesser number of passes to a dataset. …”
Get full text
Get full text
Get full text
Get full text
article -
55
Efficient Dynamic Cost Scheduling Algorithm for Financial Data Supply Chain
Published 2021“…The primary tool used in the data supply chain is data batch processing which requires efficient scheduling. …”
Get full text
article -
56
DG-Means – A Superior Greedy Algorithm for Clustering Distributed Data
Published 2022“…In this work, we present DG-means, which is a greedy algorithm that performs on distributed sets of data. …”
Get full text
Get full text
Get full text
masterThesis -
57
Deep Learning-Based Short-Term Load Forecasting Approach in Smart Grid With Clustering and Consumption Pattern Recognition
Published 2021“…<p>Different aggregation levels of the electric grid's big data can be helpful to develop highly accurate deep learning models for Short-term Load Forecasting (STLF) in electrical networks. …”
-
58
-
59
-
60