Search Results - (( solution connection based algorithm ) OR ( java simulation optimization algorithm ))*
Search alternatives:
- solution connection »
- connection based »
- java simulation »
-
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
Sizing optimization of large-scale grid connected photovoltaic system using dolphin echolocation algorithm / Muhammad Zakyizzuddin Rosselan
Published 2018“…Later, an Iterative-based Sizing Algorithm (ISA) was developed to determine the optimal sizing solution which was later used as benchmark for sizing algorithms using optimization methods. …”
Get full text
Get full text
Thesis -
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
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 -
9
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 -
10
Enhancing Market-Based Scheduling Algorithm on Globally Distributed Web Servers Using Least Suitable Sealed Bid Technique
Published 2006“…Scheduling of a multiple distributed servers is considered as a complex problem.considered as NP-complete problem,where no single efficient algorithm guaranteed to produce optimal results.This thesis investigates on how to find optimal solution for distribute system,by implementing market based scheduling Algorithm(MBSA).On implementing the MBSA, a new auction technique which is the least suitable sealed bid auction will be introduced.it is found that least suitable sealed bid technique will give the close-to-optimum solution.In the implementation, cooperative agents were used as a middleware between web servers and stand-alone schedulers. …”
Get full text
Get full text
Thesis -
11
An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network
Published 2017“…We start our algorithm by designing shortest path algorithm based on Dijkstra's method. …”
Get full text
Get full text
Get full text
Article -
12
Routing problem in rectangular mesh network using Dijkstra’s based Greedy method
Published 2018“…Therefore, developing a shortest path based routing algorithm is in need. In this research, Dijkstra’s algorithm is used to establish the shortest connection for each net. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
13
Routing problem in rectangular mesh network using shortest path based Greedy method
Published 2019“…Therefore, developing a shortest path based routing algorithm is in need. In this research, Dijkstra's algorithm is used to establish the shortest connection for each net. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
14
An Adaptive Switching Cooperative Source Searching And Tracing Algorithms For Underwater Acoustic Source Localization
Published 2019“…In order to optimize search space exploration and to maintain inter-robot communication connectivity at swarm level, a dispersion algorithm based on attraction and repulsion force is proposed. …”
Get full text
Get full text
Thesis -
15
A new approach for convert multiply-connected trees in Bayesian networks
Published 2009Get full text
Working Paper -
16
Secured Autonomous Agent-Based Intrusion Detection System (SAAIDS)
Published 2024thesis::master thesis -
17
Solving the minimum dominating set problem of partitioned graphs using a hybrid bat algorithm
Published 2020“…The BA explores a wide area of the search space; thus, it is capable of the diversification procedure. However, population-based algorithms are not good in exploiting the search space in comparison to single-solution based methods, therefore, we included the Simulated annealing (SA) algorithm to balance between exploitation and exploration in order to reach a best possible solution. …”
Get full text
Get full text
Article -
18
Routing problem in rectangular mesh network using shortest path based Greedy method
Published 2019“…Therefore, developing a shortest path based routing algorithm is in need. In this research, Dijkstra's algorithm is used to establish the shortest connection for each net. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
19
Implication of image processing algorithm in remote sensing and GIS applications
Published 2011“…Greedy algorithms expresses as a simple solution algorithm that choose a local optimum solution at each step to achieve a global optimum. …”
Get full text
Get full text
Get full text
Article -
20
Intelligent sizing and output prediction techniques for grid-connected photovoltaic system / Shahril Irwan Sulaiman
Published 2012“…Initially, two intuitive-based sizing algorithms for GCPV system design, termed as Conventional Sizing Algorithm (CSA), were developed based on two design goals. …”
Get full text
Get full text
Book Section
