Search alternatives:
using algorithm » cosine algorithm (Expand Search)
data scheduling » task scheduling (Expand Search), ahead scheduling (Expand Search)
element » elements (Expand Search)
update » updated (Expand Search)
using algorithm » cosine algorithm (Expand Search)
data scheduling » task scheduling (Expand Search), ahead scheduling (Expand Search)
element » elements (Expand Search)
update » updated (Expand Search)
-
1
Efficient Dynamic Cost Scheduling Algorithm for Data Batch Processing
Published 2016“…A Master of Science thesis in Engineering Systems Management by Alia Al Sadawi entitled, "Efficient Dynamic Cost Scheduling Algorithm for Data Batch Process," submitted in May 2016. …”
Get full text
doctoralThesis -
2
Efficient Dynamic Cost Scheduling Algorithm for Financial Data Supply Chain
Published 2021“…An iterative dynamic scheduling algorithm (DCSDBP) was developed to address the data batching process. …”
Get full text
article -
3
Stochastic Search Algorithms for Exam Scheduling
Published 2007“…Then, we empirically compare the three proposed algorithms and FESP using realistic data. Our experimental results show that SA and GA produce good exam schedules that are better than those of FESP heuristic procedure. …”
Get full text
Get full text
article -
4
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 -
5
Delay Optimization in LoRaWAN by Employing Adaptive Scheduling Algorithm With Unsupervised Learning
Published 2023Subjects: -
6
Optimizing Energy Consumption of Cloud Computing IaaS
Published 2017Subjects: Get full text
doctoralThesis -
7
Simulated annealing and genetic algorithms for exam scheduling. (c1997)
Published 1997Get full text
Get full text
masterThesis -
8
A Scatter search algorithm for exam scheduling. (c2006)
Published 2006Get full text
Get full text
masterThesis -
9
A Graph Heuristic Approach for the Data Path Allocation Problem
Published 2022Get full text
Get full text
Get full text
masterThesis -
10
Minimizing Deadline Misses of Mobile IoT Requests in a Hybrid Fog- Cloud Computing Environment
Published 2019Get full text
doctoralThesis -
11
-
12
Three-phase approach for curriculum-based course timetabling problem. (c2012)
Published 2012Subjects: “…Scheduling -- Data processing…”
Get full text
Get full text
masterThesis -
13
Cryptocurrency Exchange Market Prediction and Analysis Using Data Mining and Artificial Intelligence
Published 2020“…One of the best algorithms in terms of the result is the Long Short Term Memory (LSTM) since it is based on recurrent neural networks which uses loop as a method to learn from heuristics data. …”
Get full text
-
14
Proactive Fault Tolerance and Minimizing Task Execution Failure in A Cloud Data Center
Published 2024Subjects: Get full text
doctoralThesis -
15
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 -
16
Allocation and re-allocation of data in a grid using an adaptive genetic algorithm
Published 2006“…Allocation and re-allocation of data in a grid using an adaptive genetic algorithm. …”
Get full text
Get full text
Get full text
conferenceObject -
17
-
18
Efficient Approximate Conformance Checking Using Trie Data Structures
Published 2021“…By encoding the proxy behavior using a trie data structure, we obtain a logarithmically reduced search space for alignment computation compared to a set-based representation. …”
Get full text
Get full text
Get full text
-
19
Multilayer Reversible Data Hiding Based on the Difference Expansion Method Using Multilevel Thresholding of Host Images Based on the Slime Mould Algorithm
Published 2022“…Moreover, the image pixels in different and more similar areas of the image are located next to one another in a group and classified using the specified thresholds. As a result, the embedding capacity in each class can increase by reducing the value of the difference between two consecutive pixels, and the distortion of the marked image can decrease after inserting the personal data using the DE method. …”
Get full text
-
20