Search Results - time evaluation ((method algorithm) OR (path algorithm))
Search alternatives:
- method algorithm »
- time evaluation »
- path algorithm »
-
1
Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques
Published 2014“…The aim is to solve the above-mentioned problems via an optimization mechanism based upon the combination between runtime path prediction method and heuristic algorithms. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
2
Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja
Published 2004“…Definitely this best first search algorithm saves the searching time and improves performance of shortest path finding.…”
Get full text
Get full text
Thesis -
3
Optimisation of Environmental Risk Assessment Architecture using Artificial Intelligence Techniques
Published 2024“…By contrast, the running time of the safe path selection model (96 µs) is shorter than the running times of Dijkstra's algorithm and the Floyd- Warshall algorithm (150 µs and 184 µs, respectively). …”
thesis::doctoral thesis -
4
Real-Time Optimal Trajectory Correction (ROTC) for autonomous quadrotor / Noorfadzli Abdul Razak
Published 2018“…However, existing algorithm seems too complicated to be applied. Since there is no technique can enable the quadrotor to implement precision navigation application, the research proposed a Real-Time Optimal Trajectory Correction (ROTC) algorithm. …”
Get full text
Get full text
Thesis -
5
Nonlinear adaptive algorithm for active noise control with loudspeaker nonlinearity
Published 2014“…The proposed THF-NLFXLMS algorithm models the Wiener secondary path and applies the estimated degree of nonlinearity of the nonlinear secondary path in the control algorithm design. …”
Get full text
Get full text
Thesis -
6
Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms
Published 2008“…This thesis presents a new approach to optimize the performance of a dual beam optical scanning system in terms of its scanning combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the scanning tasks need to be segregated and assigned for each scanner head, and path planning where the best combinatorial paths for each scanner are determined in order to minimize the total motion of scanning time. …”
Get full text
Get full text
Thesis -
7
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…These algorithms are inspired by the estimation capability of the well-known Kalman filter estimation method. …”
Get full text
Get full text
Thesis -
8
Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed
Published 2017“…For test data generation, the existing search-based techniques (SBTs) have been applied to satisfy only one OCL constraint by time. In order to generate optimal data to satisfy whole constraints in the feasible path, new method with SBTs is necessary to satisfy the whole constraints at the same time of the whole path executing. …”
Get full text
Get full text
Get full text
Thesis -
9
Comparative analysis of spiral dynamic algorithm and artificial bee colony optimization for position control of flexible link manipulators
Published 2024“…This study aims to evaluate the effectiveness of two optimization algorithms, artificial bee colony (ABC) and spiral dynamic algorithm (SDA), in controlling the position of a flexible-link manipulator. …”
Get full text
Get full text
Get full text
Article -
10
Adaptable decentralized orchestration engine for block structured non-transactional workflow in service oriented architecture.
Published 2011“…The latter considers the frequent-path adaptability and both of them together satisfy both frequent-path and proportionalfragment adaptability aspects; v) A Fuzzy Decentralization Decision Making algorithm (FDDM) is presented based on the fuzzy logic to choose a suitable method of decentralization that satisfies the three adaptability aspects frequent-path,proportional- fragment and available-bandwidth; and, vi) an algorithm is introduced for wiring of dynamic fragments. …”
Get full text
Get full text
Thesis -
11
Real time nonlinear filtered-x lms algorithm for active noise control
Published 2012“…However, unlike the other algorithms, NLFXLMS cannot be implemented in real time. …”
Get full text
Get full text
Thesis -
12
Transmission path optimization Based on Efficiency Communication System
Published 2022“…In this paper, routing attribute table that is maintained by the nodes, the density and relative distance of node distribution, is used to determine the clustering method. At the same time, the developed algorithm combines the relative position of the cluster and the base station to further improve the routing method of the sub-cluster head, Finally, the algorithm analyzes the influence of different parameters on the transmission path, and use the simulation experiments to evaluate the conclusions.…”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
13
Wormhole attack detection mechanism in mobile ad hoc network using neighborhood information and path tracing algorithm
Published 2015“…The study investigates in four difierent scenarios and detects both types of wormhole attacks. Experimental evaluation shows that NIPT algorithm achieves better results in the PDR and delay with an average of 5% and 6% respectively, over the PT algorithm. …”
Get full text
Get full text
Thesis -
14
The solution of 2048 puzzle game using A* algorithm / Zafhira Ismail
Published 2017“…This project use usability test for user testing system and functionality test to evaluate the efficiency of the game. Experiment result proves high accuracy and efficiency from the proposed algorithm. …”
Get full text
Get full text
Thesis -
15
Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module
Published 2023“…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
Article -
16
Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module
Published 2023“…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
Article -
17
Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module
Published 2006“…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
Get full text
Get full text
Get full text
Article -
18
An enhancement of path selection to cluster head based on multi-hop routing in two-tier wireless sensor network
Published 2019“…By using the MATLAB simulation tool,the performance of SPF algorithm and conventional method will be evaluated. …”
Get full text
Get full text
Get full text
Get full text
Article -
19
-
20
