Search alternatives:
method algorithm » mould algorithm (Expand Search)
element » elements (Expand Search)
finding » findings (Expand Search)
method algorithm » mould algorithm (Expand Search)
element » elements (Expand Search)
finding » findings (Expand Search)
-
1
GENETIC SCHEDULING OF TASK GRAPHS
Published 2020“…A genetic algorithm for scheduling computational task graphs is presented. …”
Get full text
article -
2
GIJA:Enhanced geyser‐inspired Jaya algorithm for task scheduling optimization in cloud computing
Published 2024“…In this article, we introduce GIJA (Geyser‐inspired Jaya Algorithm), a novel optimization approach tailored for task scheduling in cloud computing environments. …”
Get full text
-
3
-
4
Efficient Prioritization and Processor Selection Schemes for HEFT Algorithm: A Makespan Optimizer for Task Scheduling in Cloud Environment
Published 2022“…Among these methods, the Heterogeneous Earliest Finish Time (HEFT) algorithm is recognized to produce optimal outcomes in a shorter time period for scheduling tasks in a heterogeneous environment. …”
-
5
-
6
Proactive Fault Tolerance and Minimizing Task Execution Failure in A Cloud Data Center
Published 2024Get full text
doctoralThesis -
7
An algorithm for solving bond pricing problem
Published 2002Get full text
Get full text
Get full text
Get full text
article -
8
Minimizing Deadline Misses of Mobile IoT Requests in a Hybrid Fog- Cloud Computing Environment
Published 2019Subjects: Get full text
doctoralThesis -
9
-
10
A simulated evolution approach to task-matching and scheduling in heterogeneous computing environments
Published 2020“…Abstract This paper applies a simulated evolution (SE) approach to the problem of matching and scheduling dependent tasks in a heterogeneous suite of computers interconnected via a high-speed network. …”
Get full text
article -
11
An evolutionary algorithm for solving the geometrically constrained site layout problem
Published 2017“…This paper presents an investigation of applying an evolutionary approach to optimally solve the aforementioned layout problem. The proposed algorithm is two-phases: an initialization phase that generates an initial population of layouts through a sequence of mutation operations, and a reproduction phase that evolve the layouts generated in phase one through a sequence of genetic operations aiming at finding an optimal layout. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
12
Optimizing Energy Consumption of Cloud Computing IaaS
Published 2017Subjects: Get full text
doctoralThesis -
13
Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem
Published 1998“…This paper describes a hybrid algorithm that combines an adaptive-type neural network algorithm and a nondeterministic iterative algorithm to solve the Euclidean traveling salesman problem (E-TSP). …”
Get full text
Get full text
article -
14
An Uncertainty Based Genetic Algorithm Approach for Project Resource Scheduling
Published 2016“…Several nonlinear optimization models were developed for this purpose assuming uniform resource availability and sequence based project tasks. The work presented in thesis add to the existing literature in a proposing the use of a genetic algorithm uncertain approach to resource- scheduling in projects. …”
Get full text
-
15
Genetic Algorithm for Solving Site Layout Problem with Unequal-Size and Constrained Facilities
Published 2002“…The proposed genetic algorithm generates an initial population of layouts through a sequence of mutation operations and evolves the layouts of this population through a sequence of genetic operations aiming at finding an optimal layout. …”
Get full text
Get full text
Get full text
article -
16
Efficient Dynamic Cost Scheduling Algorithm for Data Batch Processing
Published 2016Get full text
doctoralThesis -
17
Genetic Algorithm Analysis using the Graph Coloring Method for Solving the University Timetable Problem
Published 2018“…There are many algorithms and approaches adopted to solve this problem, but one of the effective approaches to solve it is the use of meta-heuristics. …”
Get full text
Get full text
Get full text
Get full text
article -
18
A deterministic heuristic algorithm for optimal multiprocessor scheduling. (c1995)
Published 1995Get full text
Get full text
masterThesis -
19
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 -
20