2018
DOI: 10.1166/asl.2018.13016
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Load Balancing Model Based on Server Status (DLBS) for Green Computing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(8 citation statements)
references
References 0 publications
0
8
0
Order By: Relevance
“…In ACO, artificial "ants" (simulation agents) find optimal solutions by traveling through a parameter space, signifying every single conceivable solution. The guideline of an ant colony algorithm is that a unique chemical trail (pheromone) is deposited on the soil amid trips and directs other ants toward an objective solution [9]. The path taken by ants has a high degree of pheromone deposition, and a high pheromone deposition rate encourages more ants taking the same path.…”
Section: Ant Colony Optimization (Aco)mentioning
confidence: 99%
See 1 more Smart Citation
“…In ACO, artificial "ants" (simulation agents) find optimal solutions by traveling through a parameter space, signifying every single conceivable solution. The guideline of an ant colony algorithm is that a unique chemical trail (pheromone) is deposited on the soil amid trips and directs other ants toward an objective solution [9]. The path taken by ants has a high degree of pheromone deposition, and a high pheromone deposition rate encourages more ants taking the same path.…”
Section: Ant Colony Optimization (Aco)mentioning
confidence: 99%
“…Some of these are non-deterministic NP-hard problems [8]. Reported research and practice on these procedures supported researchers for the continuous extension and intensification of SI and metaheuristics [9] The historical backdrops of metaheuristics and SI are particularly interwoven. Among the first and highly acknowledged metaheuristics are Tabu Search, Genetic Algorithms, and Simulated Annealing (SA).…”
Section: Introductionmentioning
confidence: 99%
“…This is a recent development [14][15][16][17][18] in data classification which performs prediction by selecting the majority class at each leaf. The incorporation of Naive Bayes models at the tree leaves can improve the predictive accuracy of HT.…”
Section: Hoeffding Tree (Ht)mentioning
confidence: 99%
“…Considering the PSO algorithm, position and velocity computation resemble the basic PSO algorithm. The position calculation is smoothed by an additional velocity factor [24,25]; that is, a factor is activated in case the average swarm velocity is higher than the maximum velocity. A comparison to the basic PSO and PSO modifications proves HSO outperformed the known methods.…”
Section: The Metaheuristic Search (Aco and Pso) Algorithmsmentioning
confidence: 99%