Search Results - optimal ((((drop algorithm) OR (graph algorithm))) OR (((drops algorithm) OR (path algorithm))))
Search alternatives:
- graph algorithm »
- drop algorithm »
- path algorithm »
-
1
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…In the benchmarking of the SKF and ssSKF algorithms’ performance in solving the 14-hole PCB drill path optimization case study with recent implementations, on average, both algorithms show the ability to converge to the optimal solution at a smaller number of function evaluations compared to the Gravitational Search Algorithm (GSA), Cuckoo Search (CS), and Intelligent Water Drop (IWD), although fall-short to the Taguchi- Genetic Algorithm optimization algorithm.…”
Get full text
Get full text
Thesis -
2
Optimized topology control in mobile IP networks using a new parametric routing algorithm
Published 2018“…Then, a new optimal routing algorithm is proposed to make up the node failure and changing Foreign Agent (FA). …”
Get full text
Get full text
Get full text
Article -
3
Intelligent Examination Timetabling System Using Hybrid Intelligent Water Drops Algorithm
Published 2024Subjects:Proceedings Paper -
4
Benchmark simulator with dynamic environment for job scheduling in grid computing
Published 2014“…Job scheduling algorithm has a significant influence on grid computing performance. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
5
Solving university examination timetabling problem using intelligent water drops algorithm
Published 2024Subjects: “…Intelligent water drops algorithm…”
Conference Paper -
6
Modified And Ensemble Intelligent Water Drop Algorithms And Their Applications
Published 2015“…The Intelligent Water Drop (IWD) algorithm is a swarm-based model that is useful for undertaking optimization problems. …”
Get full text
Get full text
Thesis -
7
Energy balancing mechanisms for decentralized routing protocols in wireless sensor networks
Published 2012“…It is based on Ant Colony Optimization (ACO) meta heuristic, which is adopted to enhance the paths with the best-quality function. …”
Get full text
Get full text
Thesis -
8
Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article
Published 2010“…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
Get full text
Get full text
Article -
9
Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator
Published 2010“…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
Get full text
Get full text
Student Project -
10
Path Optimization For Cooperative Multi-Head 3d Printing
Published 2020“…Hence, finding the best path for the nozzle is termed as the Layer Path Optimization Problem (LPOP). …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
11
Analysis and modeling of database storage optimization power consumption usage for green data centers
Published 2014“…The proxies can be discovered by using a developed algorithm of functional dependencies (FDs) called as TANE algorithm. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
12
IWDSA: a hybrid Intelligent Water Drops with a Simulated Annealing for the localization improvement in wireless sensor networks
Published 2024“…The proposed algorithm, named Intelligent Water Drops with Simulated Annealing (IWDSA), combines two powerful optimization methods: Intelligent Water Drops (IWD) and Simulated Annealing (SA). …”
Get full text
Get full text
Get full text
Article -
13
Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system
Published 2021“…This solution depending on applying the optimization on an optimal path while the traditional ACO is optimizing the random path based on the greedy algorithm hence we get the most optimal path. …”
Get full text
Get full text
Get full text
Article -
14
Improving Network Consistency and Data Availability Using Fuzzy C Mean Clustering Algorithm in Wireless Sensor Networks
Published 2024thesis::doctoral thesis -
15
Route optimization using shortest path method / Muhamad Faisal Amin Shakri
Published 2025“…Each algorithm was tested to compute the shortest path, with results indicating that while all algorithms arrive at the same optimal route, their efficiency differs. …”
Get full text
Get full text
Thesis -
16
African Buffalo Optimization (ABO): A New Metaheuristic Algorithm
Published 2015“…When compared to the Ant Colony Optimization algorithm, Simulated Annealing and Genetic Algorithm, the results obtained from African Buffalo Optimization show that the algorithm works well and can be extended to solving problems like: path planning, scheduling, vehicle routing in addition to other constraint-driven problems.…”
Get full text
Get full text
Get full text
Article -
17
Hybrid Intelligent Water Drops Algorithm For Examination Timetabling Problem
Published 2024Subjects: “…Examination Time table, Intelligent Water Drops algorithm, Metaheuristic, Locale search algorithm, Optimization…”
Article -
18
Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah
Published 1997“…The comparison between euler's path and Bipartite graph Algorithm [14] will be made at the end this of this report to see which one give optimal chaining .…”
Get full text
Get full text
Thesis -
19
Optimization of electrical wiring design in buildings using particle swarm optimization and genetic algorithm / Tuan Ahmad Fauzi Tuan Abdullah
Published 2017“…In this project, the main objective is to optimize the electrical distribution system design in buildings using optimization methods, which are Particle Swarm Optimization (PSO) and Genetic Algorithm (GA). …”
Get full text
Get full text
Thesis -
20
Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan
Published 1997“…Searching for possible abutment between the transistor pairs are modelled as a bipartite graph. A depth - first search algorithm is used to search for optimal chaining. …”
Get full text
Get full text
Thesis
