Search Results - (( java simulation optimization algorithm ) OR ( using filled function algorithm ))
Search alternatives:
- function algorithm »
- java simulation »
- using filled »
-
1
Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection
Published 2022“…The simulation is implemented with iFogSim and java programming language. …”
Get full text
Get full text
Article -
2
Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing
Published 2011“…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
Get full text
Get full text
Get full text
Thesis -
3
An efficient method for determining all the extreme points of function with one variable
Published 2014“…The algorithm is the combination of the filled function's algorithm and Inner Iteration algorithm, called IRH's algorithm, in which Inner Iteration algorithm works at the domain which is usually ignored by filled function's algorithm.…”
Get full text
Thesis -
4
Ant colony optimization algorithm for load balancing in grid computing
Published 2012“…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
Get full text
Get full text
Get full text
Monograph -
5
A modified discrete filled function algorithm for solving nonlinear discrete optimization problems
Published 2012“…The discrete filled function method is a global optimization tool for searching for best solution amongst multiple local optima.This method has proven useful for solving large-scale discrete optimization problems.In this paper, we consider a standard discrete filled function algorithm in the literature and then propose a modification to increase its efficiency.…”
Get full text
Get full text
Get full text
Conference or Workshop Item -
6
OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT
Published 2023“…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”
Review -
7
Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization
Published 2019“…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
Get full text
Get full text
Thesis -
8
Features selection for intrusion detection system using hybridize PSO-SVM
Published 2016“…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
Get full text
Get full text
Thesis -
9
Global Algorithms for Nonlinear Discrete Optimization and Discrete-Valued Optimal Control Problems
Published 2009“…Then, we construct an auxiliary function, called a discrete filled function, at this local minimizer. …”
Get full text
Get full text
Get full text
Thesis -
10
Resource management in grid computing using ant colony optimization
Published 2011“…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization.Experimental results show that EACO produced better grid resource management solution.…”
Get full text
Get full text
Get full text
Get full text
Monograph -
11
Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter
Published 2019“…Cloudsim is used as Discrete Event Simulation tool and Java as coding language to evaluate LACE algorithm. …”
Get full text
Get full text
Thesis -
12
Flower pollination algorithm for data generation and analytics - a diagnostic analysis
Published 2020“…This paper aims to fill the gap in literature of the Flower Pollination Algorithm in terms of diagnostic assessment of the impact of the number of iteration and search agents in solving the popular benchmark Sphere function and the unpopular but complex multimodal Dejong 5 function, otherwise called Shekel Foxhole function. …”
Get full text
Get full text
Get full text
Article -
13
SINE COSINE ALGORITHM BASED NEURAL NETWORK FOR RAINFALL DATA IMPUTATION
Published 2024“…The Sine Cosine Algorithm (SCA) is a relatively recent metaheuristic algorithm, drawing inspiration from the characteristics of trigonometric sine and cosine functions. …”
Get full text
Get full text
Get full text
Book Chapter -
14
SG-PBFS : Shortest Gap-Priority Based Fair Scheduling technique for job scheduling in cloud environment
Published 2024“…To conduct this experiment, we employed the CloudSim simulator, which is implemented using the Java programming language.…”
Get full text
Get full text
Get full text
Get full text
Article -
15
-
16
Estimation of photovoltaic models using an enhanced Henry gas solubility optimization algorithm with first-order adaptive damping Berndt-Hall-Hall-Hausman method
Published 2024“…The proposed EHGSO methodology based on the adaptive damping BHHH technique (EHGSOAdBHHH) is tested on Single Diode (SD), and Double Diode (DD) PV models using actual experimental data. EHGSOAdBHHH exhibits outstanding accordance with attained experimental data compared with other algorithms, and its superiority is validated using several statistical criteria.…”
Get full text
Get full text
Article -
17
Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms
Published 2018“…HS algorithm has been modified to handle the 0/1 Knapsack problem, such as adding penalty function to cope the weight condition, exclude the harmony search bandwidth (bw) parameter, and use the current best result in the next iteration to obtain a better result. …”
Get full text
Get full text
Get full text
Get full text
Article -
18
Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data
Published 2023“…Meta-heuristic searching with embedding information theory-based criteria in the fitness function for selecting the relevant features is used widely in current feature selection algorithms. …”
Get full text
Get full text
Get full text
Article -
19
Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data
Published 2023“…Meta-heuristic searching with embedding information theory-based criteria in the fitness function for selecting the relevant features is used widely in current feature selection algorithms. …”
Get full text
Get full text
Get full text
Article -
20
Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data
Published 2023“…Meta-heuristic searching with embedding information theory-based criteria in the fitness function for selecting the relevant features is used widely in current feature selection algorithms. …”
Get full text
Get full text
Get full text
Article
