Search Results - (( developing based m algorithm ) OR ( java optimization path algorithm ))
Search alternatives:
- java optimization »
- optimization path »
- developing based »
- path algorithm »
- m algorithm »
- based m »
-
1
Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization
Published 2019“…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
Get full text
Get full text
Thesis -
2
SecPath: Energy efficient path reconstruction in wireless sensor network using iterative smoothing
Published 2019“…This work uses iterative smoothing algorithm to find an alternative path with less distance and energy consumption. …”
Get full text
Get full text
Thesis -
3
Energy efficient path reconstruction in wireless sensor network using iPath
Published 2019“…This work uses iterative boosting algorithm to find an alternative path with less distance and energy consumption. …”
Get full text
Get full text
Get full text
Article -
4
Visdom: Smart guide robot for visually impaired people
Published 2025“…Core functionalities such as path planning, autonomous movement, voice feedback, and app-to-robot communication have been thoroughly tested and optimized. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
5
Development of Simulated Annealing Based Scheduling Algorithm for Two Machines Flow Shop Problem
Published 2015“…Viewing as optimization problem and focusing on two machines, this research aims to develop a new Simulated Annealing based scheduling algorithm, called SA2M, for flow shop problem. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
6
-
7
-
8
Development of New Genetic Algorithm Software for Blow Mould Process
Published 2008Get full text
Get full text
Conference or Workshop Item -
9
-
10
-
11
-
12
-
13
-
14
Makespan algorithms and heuristic for internet-based collaborative manufacturing process using bottleneck approach
Published 2010“…It was shown that using bottleneck-based analysis, effective makespan algorithms and constructive heuristic can be developed to solve for near-optimal scheduling sequence. …”
Get full text
Get full text
Get full text
Article -
15
-
16
Iterative closed-loop identification of MIMO systems using ARX-based Leaky Least Mean Square Algorithm
Published 2014Get full text
Get full text
Conference or Workshop Item -
17
-
18
-
19
-
20
