Search Results - (( java simulation optimization algorithm ) OR ( a constructive path algorithm ))
Search alternatives:
- constructive path »
- java simulation »
- a constructive »
- path algorithm »
-
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
A generalized laser simulator algorithm for optimal path planning in constraints environment
Published 2022“…Path planning refers to a robot's search for a collision-free and optimal path from a start point to a predefined goal position in a given environment. …”
Get full text
Thesis -
5
A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments
Published 2013“…Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
Get full text
Get full text
Thesis -
6
Route optimization using shortest path method / Muhamad Faisal Amin Shakri
Published 2025“…This study investigated the implementation and comparison between well known shortest path method which are Dijkstra’s algorithm, Bellman-Ford, and A* algorithm. …”
Get full text
Get full text
Thesis -
7
Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff
Published 2011“…In the initial stage, the test environments were constructed. Subsequently, both algorithms were applied to the test environments. …”
Get full text
Get full text
Thesis -
8
Autonomous path planning robot using geographical information
Published 2008Get full text
Learning Object -
9
Wi-fi fingerprint database construction using Chebyshev wavelet functions
Published 2015“…Our algorithm requires only a few samples to be collected in a given region, and thus significantly reduces the calibration time. …”
Get full text
Get full text
Conference or Workshop Item -
10
An efficient algorithm to improve oil-gas pipelines path
Published 2018“…Therefore, the aim of this study is to propose a new algorithm to obtain the shortest path connecting oil-gas wells and addressing obstacles that may appear on the path connecting any two wells. …”
Get full text
Article -
11
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 -
12
The impact of clustering on the average path length in wireless sensor networks
Published 2015“…Clustering algorithms have been widely used in wireless sensor networks for virtual backbone construction. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
13
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 -
14
Shortest path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm / Nur Syuhada Muhammat Pazil ... [et al.]
Published 2020“…Nevertheless, both time and cost of shortest path are constructed in different paths. The time and cost of the journey are described by driving a car from Bandar Tun Razak to Lebuhraya SMART to Kampung Pandan, then Berjaya Times Square. …”
Get full text
Get full text
Get full text
Article -
15
An application of Floyd-Warshall Algortihm in finding shortest path of order picker in warehouse / Saidatul Aisyah Roslan, Siti Norhakimah Mohd Yatim and Siti Sarah Sulaiman
Published 2019“…This algorithm run in a software called Toolkit for Oracle (TORA) software. …”
Get full text
Get full text
Student Project -
16
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 -
17
Optimizing optimal path trace back for Smith-Waterman algorithm using structural modelling technique
Published 2012“…The optimizing of optimal path trace back system for Smith-Waterman algorithm using structural modelling techniques are presented in this paper. …”
Get full text
Get full text
Student Project -
18
Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques
Published 2014“…However, when compositions contain more than one execution path (i.e., multiple path's compositions), it is difficult to generate a composite service that simultaneously optimizes all the execution paths involved in the composite service at the same time while meeting the QoS requirements. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
19
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 -
20
Design and analysis of construction and recombination module using Idury Waterman Algorithm for fragment assembly application / Hafifi Mohd Rafi
Published 2012“…There is several algorithms use in sequencing of DNA fragment. This paper presents a study on design and analysis of construction and recombination module using IduryWaterman algorithm and fragment assembly application using Verilog. …”
Get full text
Get full text
Thesis
