Search Results - (( java simulation optimization algorithm ) OR ( pre optimization based algorithm ))
Search alternatives:
-
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
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 -
4
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 -
5
Optimizing Cloud Storage Costs: Introducing the Pre-Evaluation-Based Cost Optimization (PECSCO) Mechanism
Published 2025“…The core of the algorithm utilizes a Genetic Algorithm (GA) to find the optimal position for the first evaluator by minimizing the total distance between this evaluator and all CCTV nodes, aiming for surveillance efficiency. …”
Conference paper -
6
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 -
7
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 -
8
One day ahead daily peak hour load forecasting by using invasive weed optimization learning algorithm based Artificial Neural Network
Published 2012“…Hence, this indicates that Invasive Weed Optimization could be implemented as a new learning algorithm for an Artificial Neural Network.…”
Get full text
Get full text
Student Project -
9
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 -
10
Effects of Different Superpixel Algorithms on Interactive Segmentations
Published 2022“…In this study, five different types of superpixels ranging from watershed, density, graph, clustering and energy optimization categories are evaluated. The superpixels generated by these five algorithms will be used on two interactive image segmentation algorithms: i) Maximal Similarity based Region Merging (MSRM) and ii) Graph-Based Manifold Ranking (GBMR) with single and multiple strokes on various images from the Berkeley image dataset. …”
Get full text
Get full text
Get full text
Article -
11
A Novel Wrapper-Based Optimization Algorithm for the Feature Selection and Classification
Published 2023“…Moreover, K-Nearest Neighbor (KNN) classifier was used to evaluate the effectiveness of the features identified by the proposed SCSO algorithm. The performance of the proposed SCSO algorithm was compared with six state-of-the-art and recent wrapper-based optimization algorithms using the validation metrics of classification accuracy, optimum feature size, and computational cost in seconds. …”
Get full text
Get full text
Article -
12
Improved opposition-based particle swarm optimization algorithm for global optimization
Published 2021“…Particle Swarm Optimization (PSO) has been widely used to solve various types of optimization problems. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article -
13
-
14
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 -
15
Feature selection based on particle swarm optimization algorithm for sentiment analysis classification
Published 2021“…An improved approach was proposed to increase the sentiment analysis accuracy based on text pre-processing and Naïve Bayes Classifier algorithm hybrid with Particle Swarm Optimization (NBC-PSO). …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
16
Document clustering for knowledge discovery using nature-inspired algorithm
Published 2014“…As the internet is overload with information, various knowledge based systems are now equipped with data analytics features that facilitate knowledge discovery.This includes the utilization of optimization algorithms that mimics the behavior of insects or animals.This paper presents an experiment on document clustering utilizing the Gravitation Firefly algorithm (GFA).The advantage of GFA is that clustering can be performed without a pre-defined value of k clusters.GFA determines the center of clusters by identifying documents with high force.Upon identification of the centers, clusters are created based on cosine similarity measurement.Experimental results demonstrated that GFA utilizing a random positioning of documents outperforms existing clustering algorithm such as Particles Swarm Optimization (PSO) and K-means.…”
Get full text
Get full text
Get full text
Conference or Workshop Item -
17
Effects of Different Superpixel Algorithms on Interactive Segmentations
Published 2022“…In this study, five different types of superpixels ranging from watershed, density, graph, clustering and energy optimization categories are evaluated. The superpixels generated by these five algorithms will be used on two interactive image segmentation algorithms: i) Maximal Similarity based Region Merging (MSRM) and ii) Graph-Based Manifold Ranking (GBMR) with single and multiple strokes on various images from the Berkeley image dataset. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article -
18
A New Pre-Processing Technique For Computational Of Stereo Matching Algorithm
Published 2021“…At the fourth stage; disparity optimization stage, the disparity map is optimized with a common local technique, Winner-Take-All (WTA). …”
Get full text
Get full text
Get full text
Get full text
Article -
19
Optimized clustering with modified K-means algorithm
Published 2021“…Among the techniques, the k-means algorithm is the most commonly used technique for determining optimal number of clusters (k). …”
Get full text
Get full text
Get full text
Get full text
Thesis -
20
Automatic Number Plate Recognition on android platform: With some Java code excerpts
Published 2016“…Hence, the objective of this research is to propose suitable and optimize algorithm for ANPR system on Android mobile phone. …”
Get full text
Get full text
Get full text
Book
