Search alternatives:
method algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
element » elements (Expand Search)
method algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
element » elements (Expand Search)
-
21
Three-phase simulated annealing algorithms for exam scheduling
Published 2003“…We empirically compare 3PSA with a 4-phase clustering-based heuristic algorithm using realistic data. Our experimental results show that 3PSA produces good exam schedules, which are better than those of the clustering heuristic procedure.…”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
22
A genetic algorithm for testable data path synthesis
Published 2017Get full text
Get full text
Get full text
Get full text
conferenceObject -
23
A neural networks algorithm for data path synthesis
Published 2003“…This paper presents a deterministic parallel algorithm to solve the data path allocation problem in high-level synthesis. …”
Get full text
Get full text
Get full text
article -
24
Data reductions and combinatorial bounds for improved approximation algorithms
Published 2016“…Kernelization algorithms in the context of Parameterized Complexity are often based on a combination of data reduction rules and combinatorial insights. …”
Get full text
Get full text
Get full text
Get full text
article -
25
Distributed dimension reduction algorithms for widely dispersed data
Published 2002Get full text
Get full text
Get full text
conferenceObject -
26
-
27
Data of simulation model for photovoltaic system's maximum power point tracking using sequential Monte Carlo algorithm
Published 2024“…Additionally, these data can be readily applied to compare algorithmic results referenced by (Babu, T.S. et al., 2015; PrasanthRam, J. et al., 2017) [2,3], and contribute to the development of new processes for practical applications.…”
Get full text
Get full text
Get full text
article -
28
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. …”
-
29
-
30
-
31
A Scatter search algorithm for exam scheduling. (c2006)
Published 2006Get full text
Get full text
masterThesis -
32
Eye-Clustering: An Enhanced Centroids Prediction for K-means Algorithm
Published 2024“…Various clustering methods are available, including K-means, hierarchical clustering, and density-based clustering. Among these, K-means is widely used for efficiently solving clustering problems. …”
Get full text
Get full text
Get full text
masterThesis -
33
-
34
Estimating Construction Project Duration Using a Machine Learning Algorithm
Published 2024Get full text
Get full text
Get full text
masterThesis -
35
Predicting Dropouts among a Homogeneous Population using a Data Mining Approach
Published 2019“…Our research relies solely on pre-college and college performance data available in the institutional database. Our research reveals that the Gradient Boosted Trees is a robust algorithm that predicts dropouts with an accuracy of 79.31% and AUC of 88.4% using only pre-enrollment data. …”
Get full text
-
36
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>…”
-
37
-
38
Efficient Dynamic Cost Scheduling Algorithm for Data Batch Processing
Published 2016Get full text
doctoralThesis -
39
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 -
40
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