Search alternatives:
method algorithm » mould algorithm (Expand Search)
data scheduling » task scheduling (Expand Search), ahead scheduling (Expand Search)
element » elements (Expand Search)
method algorithm » mould algorithm (Expand Search)
data scheduling » task scheduling (Expand Search), ahead scheduling (Expand Search)
element » elements (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
Three-phase approach for curriculum-based course timetabling problem. (c2012)
Published 2012Subjects: “…Scheduling -- Data processing…”
Get full text
Get full text
masterThesis -
3
-
4
Simulated annealing and genetic algorithms for exam scheduling. (c1997)
Published 1997Get full text
Get full text
masterThesis -
5
A Scatter search algorithm for exam scheduling. (c2006)
Published 2006Get full text
Get full text
masterThesis -
6
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 -
7
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 -
8
Proactive Fault Tolerance and Minimizing Task Execution Failure in A Cloud Data Center
Published 2024Subjects: Get full text
doctoralThesis -
9
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 -
10
Delay Optimization in LoRaWAN by Employing Adaptive Scheduling Algorithm With Unsupervised Learning
Published 2023Subjects: -
11
A Tabu Search algorithm for mapping data to multicomputers. (c1997)
Published 1997Get full text
Get full text
masterThesis -
12
Optimizing Energy Consumption of Cloud Computing IaaS
Published 2017Subjects: Get full text
doctoralThesis -
13
-
14
Variable Selection in Data Analysis: A Synthetic Data Toolkit
Published 2024“…Variable (feature) selection plays an important role in data analysis and mathematical modeling. This paper aims to address the significant lack of formal evaluation benchmarks for feature selection algorithms (FSAs). …”
Get full text
article -
15
-
16
On-site workshop investment problem: A novel mathematical approach and solution procedure
Published 2023Subjects: -
17
Physical optimization algorithms for mapping data to distributed-memory multiprocessors
Published 1992“…We also present a technique for efficient mapping of large data sets. The algorithms include a parallel genetic algorithm (PGA), a parallel neural network algorithm (PNN) and a parallel simulated annealing algorithm (PSA). …”
Get full text
Get full text
Get full text
masterThesis -
18
Properties of simulated annealing and genetic algorithms for mapping data to multicomputers
Published 1997“…We experimentally analyze some properties of simulated annealing algorithms (SA) and genetic algorithms (GA) for mapping data to multicomputers. …”
Get full text
Get full text
Get full text
article -
19
Parallel physical optimization algorithms for allocating data to multicomputer nodes
Published 1994“…Three parallel physical optimization algorithms for allocating irregular data to multicomputer nodes are presented. …”
Get full text
Get full text
Get full text
article -
20