Search alternatives:
point algorithm » cosine algorithm (Expand Search), colony algorithm (Expand Search)
data algorithm » jaya algorithm (Expand Search), deer algorithm (Expand Search)
element » elements (Expand Search)
point algorithm » cosine algorithm (Expand Search), colony algorithm (Expand Search)
data algorithm » jaya algorithm (Expand Search), deer algorithm (Expand Search)
element » elements (Expand Search)
-
1
Data of simulation model for photovoltaic system's maximum power point tracking using sequential Monte Carlo algorithm
Published 2024“…The mathematical design and methodology of the complete PV system were detailed in our prior research, titled "Dynamic and Adaptive Maximum Power Point Tracking Using Sequential Monte Carlo Algorithm for Photovoltaic System" by Odat et al. (2023) [1]. …”
Get full text
Get full text
Get full text
article -
2
An Effective Hybrid NARX-LSTM Model for Point and Interval PV Power Forecasting
Published 2021“…First, the NARXNN model acquires the data to generate a residual error vector. Then, the stacked LSTM model, optimized by Tabu search algorithm, uses the residual error correction associated with the original data to produce a point and interval PVPF. …”
-
3
A genetic algorithm for testable data path synthesis
Published 2017Get full text
Get full text
Get full text
Get full text
conferenceObject -
4
An enhanced k-means clustering algorithm for pattern discovery in healthcare data
Published 2015“…The proposed algorithm, which we call G-means, utilizes a greedy approach to produce the preliminary centroids and then takes k or lesser passes over the dataset to adjust these center points. …”
Get full text
Get full text
Get full text
Get full text
article -
5
-
6
-
7
Bird’s Eye View feature selection for high-dimensional data
Published 2023“…This approach is inspired by the natural world, where a bird searches for important features in a sparse dataset, similar to how a bird search for sustenance in a sprawling jungle. BEV incorporates elements of Evolutionary Algorithms with a Genetic Algorithm to maintain a population of top-performing agents, Dynamic Markov Chain to steer the movement of agents in the search space, and Reinforcement Learning to reward and penalize agents based on their progress. …”
-
8
GENETIC SCHEDULING OF TASK GRAPHS
Published 2020“…A genetic algorithm for scheduling computational task graphs is presented. …”
Get full text
article -
9
Spider monkey optimizations: application review and results
Published 2024“…Optimization algorithms are applied to find efficient solutions in different problems in several fields such as the routing in wireless networks, cloud computing, big data, image processing and scheduling, and so forth. …”
Get full text
-
10
Capturing outline of fonts using genetic algorithm and splines
Published 2001“…We present a method to convert the original problem into a discrete combinatorial optimization problem and solve it by a genetic algorithm. We also incorporate a corner detection algorithm to detect significant points which are necessary to capture a pleasant looking spline fitting for shapes such as fonts. …”
Get full text
Get full text
article -
11
The effects of data balancing approaches: A case study
Published 2023“…Furthermore, to cope with a large number of missing data points in the given dataset, a replacement with random low values strategy was applied. …”
-
12
A Parallel Neural Networks Algorithm for the Clique Partitioning Problem
Published 2002“…The clique partitioning problem has important applications in many areas including VLSI design automation, scheduling, and resources allocation. In this paper we present a parallel algorithm to solve the above problem for arbitrary graphs using a Hopfield Neural Network model of computation. …”
Get full text
Get full text
article -
13
-
14
Eye-Clustering: An Enhanced Centroids Prediction for K-means Algorithm
Published 2024“…To achieve this goal, supervised machine learning was employed to train models on graphs with labeled data points, where each graph contains a set of points and a label indicating the centroid determined by K-means. …”
Get full text
Get full text
Get full text
masterThesis -
15
Novel Peak Detection Algorithms for Pileup Minimization in Gamma Ray Spectroscopy
Published 2006“…Gamma pulses from a 3" Na(TI) scintillation detector were captured as single and double pulses for the purpose of testing the peak detection algorithms. The pulse classification technique was tested successfully on a TMS320C6000 high performance floating-point processor yielding a reduction of the execution time to 2 msec…”
Get full text
Get full text
article -
16
XBeGene: Scalable XML Documents Generator by Example Based on Real Data
Published 2012“…Inspired by the query-by-example paradigm in information retrieval, Our generator system i)allows the user to provide her own sample XML documents as input, ii) analyzes the structure, occurrence frequencies, and content distributions for each XML element in the user input documents, and iii) produces synthetic XML documents which closely concur, in both structural and content features, to the user's input data. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
17
Heat rate curve approximation for power plants without data measuring devices
Published 2012“…In this work, a numerical method, based on the one-dimensional finite difference technique, is proposed for the approximation of the heat rate curve, which can be applied for power plants in which no data acquisition is available. Unlike other methods in which three or more data points are required for the approximation of the heat rate curve, the proposed method can be applied when the heat rate curve data is available only at the maximum and minimum operating capacities of the power plant. …”
Get full text
article -
18
-
19
Predicting the Heats of Fusion of Ionic Liquids via Group Contribution Modeling and Machine Learning
Published 2022Get full text
doctoralThesis -
20
BioNetApp: An interactive visual data analysis platform for molecular expressions
Published 2019“…BioNetApp also provides data clustering based on molecular concentrations using Self Organizing Maps (SOM), K-Means, K-Medoids, and Farthest First algorithms.…”