Search Results - (( its application path algorithm ) OR ( job application ((bee algorithm) OR (bat algorithm)) ))*
Search alternatives:
- application path »
- its application »
- job application »
- path algorithm »
- bee algorithm »
- bat algorithm »
-
1
Multi-Robot Learning with Bat Algorithm With Mutation (Bam)
Published 2022“…BAT algorithm is implemented to achieve the target. …”
Get full text
Get full text
Undergraduates Project Papers -
2
Multi objective bee colony optimization framework for grid job scheduling
Published 2013“…Grid computing is the infrastructure that involves a large number of resources like computers, networks and databases which are owned by many organizations.Job scheduling problem is one of the key issues because of high heterogeneous and dynamic nature of resources and applications in the grid computing environment.Bee colony approach has been used to solve this problem because it can be easily adapted to the grid scheduling environment.The bee algorithms have shown encouraging results in terms of time and co st.In this paper a framework for multi objective bee colony optimization is proposed to schedule batch jobs to available resources where the number of jobs is greater than the number of resources.Pareto analysis and k-means analysis are integrated in the bee colony optimization algorithm to facilitate the scheduling of jobs to resources.…”
Get full text
Get full text
Get full text
Conference or Workshop Item -
3
-
4
Bee foraging behaviour techniques for grid scheduling problem
Published 2013“…Grid computing is the infrastructure that involves a large number of resources like computers, networks and databases which are owned by many organizations.These resources are collected together to make a huge computing power.Job scheduling problem is one of the key issues in grid computing and failing to look into grid scheduling results in uncompleted view of the grid computing.Achieving optimized performance of grid system, and matching application requirements with available computing resources, are the objectives of grid job scheduling.Bee colony approaches are more adaptive to grid scheduling due to high heterogeneous and dynamic nature of resources and applications in grid.These algorithms have shown encouraging results in terms of time and cost.This paper presents some resent research activities inspired by bee foraging behavior for grid job scheduling especially ABC and BCO approaches.Different original studies related to this area are briefly described along with their comparisons against them and results.The review summary of their derived algorithms and research efforts is done.…”
Get full text
Get full text
Get full text
Article -
5
IMPLEMENTATION OF GRAPH BASED PATH PLANNING ALGORITHMS FOR INDOOR NAVIGATION
Published 2018“…Thus, the A* algorithm is implemented in a small mobile robot, this is to see its effectiveness in real world application. …”
Get full text
Get full text
Final Year Project -
6
An experiment on the performance of shortest path algorithm
Published 2016Get full text
Get full text
Get full text
Conference or Workshop Item -
7
-
8
Performance comparison of a and Dijkstra algorithms with bézier curve in 2D grid and OpenStreetMap scenarios
Published 2025“…On the other hand, Dijkstra's algorithm, though robust and optimal, exhibited longer runtimes and produced paths with more turns due to its exhaustive search approach. …”
Get full text
Get full text
Get full text
Article -
9
Comparison of path planning in simulated robot
Published 2020“…This is because each path planning algorithm has its own applicable domain, performance, advantages and disadvantages in various situations. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
10
Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja
Published 2004“…This thesis also provides an explanation about the advantages. functions, characteristics. the degree of complexity in A • algorithm and its implementation in real-world application. …”
Get full text
Get full text
Thesis -
11
-
12
Modeling dynamic weight for 3D navigation routing
Published 2007“…Currently, most of shortest path algorithm used in GIS application is often not sufficient for efficient management in time-critical applications such as emergency response applications. …”
Get full text
Get full text
Conference or Workshop Item -
13
-
14
Railway shortest path planner application using ant colony optimization algorithm / Muhammad Hassan Firdaus Ruslan
Published 2017“…For the process module, Ant Colony Optimization (ACO) algorithm was used to find the shortest path. Using ACO, a Railway Shortest Path Planner (RSPP) application will be developed to help user determine their shortest path from one station to another. …”
Get full text
Get full text
Thesis -
15
-
16
All-pass filtered x least mean square algorithm for narrowband active noise control
Published 2018“…The results also show that the proposed method outperforms other LMS algorithm without secondary path modelling. The proposed narrowband LMS algorithm would benefit in the design of efficient feedforward ANC system that can realize noise control in air intake duct applications.…”
Get full text
Get full text
Get full text
Get full text
Article -
17
-
18
-
19
Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim
Published 2017“…Dijkstra’s algorithm is one of the classic shortest path search algorithms. …”
Get full text
Get full text
Thesis -
20