Search Results - (( using function ((method algorithm) OR (path algorithm)) ) OR ( using active problem algorithm ))
Search alternatives:
- problem algorithm »
- method algorithm »
- using function »
- path algorithm »
- active problem »
- using active »
-
1
Nonlinear FXLMS algorithm for active noise control systems with saturation nonlinearity
Published 2012“…In this paper, a new method to model the secondary path using the Hammerstein model structure and tangential hyperbolic function (THF) is proposed. …”
Get full text
Get full text
Get full text
Article -
2
Controller placement problem in the optimization of 5G based SDN and NFV architecture
Published 2021“…Extensive computations utilizing MATLAB 2018a on the Intel Core i7/Gen 10 processor and 16 GB of RAM are used to evaluate the algorithm efficacy. According to the blueprint of our heuristic method, the allocation and the optimum number of controllers under an effective decentralized policy could achieve higher efficiency. …”
Get full text
Get full text
Thesis -
3
Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah
Published 1997“…The euler's path it using pseudo input and Heuristic algorithm to find the minimum interlace. …”
Get full text
Get full text
Thesis -
4
Cognitive map approach for mobility path optimization using multiple objectives genetic algorithm
Published 2023Conference Paper -
5
Nlfxlms and thf-nlfxlms algorithms for wiener-hammerstein nonlinear active noise control
Published 2016“…However, this assumption may lead to inaccurate secondary path model. In this work, the modelling of acoustic path using FIR filters is incorporated for both algorithms for Wiener-Hammerstein structure. …”
Get full text
Get full text
Thesis -
6
Development of robust control scheme for wheeled mobile robot in restricted environment
Published 2021“…A novel algorithm so called laser simulator logic (LSL) has been develo ped to estimate the inertia moment when the environment is noisy and cannot use fuzzy logic algorithm. …”
Get full text
Get full text
Thesis -
7
Hybrid path planning for indoor robot with Laplacian Behaviour-based control via four point-explicit group
Published 2014“…Consequently, the gradient of the potential functions would be used by the searching algorithm to generate path from starting to goal location. …”
Get full text
Get full text
Get full text
Article -
8
A generalized laser simulator algorithm for optimal path planning in constraints environment
Published 2022“…A statistical test was used to demonstrate the efficiency of the proposed algorithm over the compared methods. …”
Get full text
Thesis -
9
Robotic indoor path planning using dijkstra's algorithm with multi-layer dictionaries
Published 2016“…The path computed using the classic Dijkstra's algorithm is the shortest; however, it may not be the most feasible. …”
Get full text
Get full text
Conference or Workshop Item -
10
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 -
11
-
12
Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja
Published 2004“…The steps to calculate a shortest path using A • algorithm is shown by using appropriate examples and related figures. …”
Get full text
Get full text
Thesis -
13
Modelling of multi-robot system for search and rescue
Published 2023“…Moreover, to cope with dynamic environments, a combination of global and local path planning methods is introduced. The PSO algorithm functions as a global path planner, determining the complete path for each robot, whereas a sensor-based obstacle avoidance algorithm serves as a local planner to avoid collision with dynamic obstacles during navigation. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
14
The Implementation of Genetic Algorithm in Path Optimization
Published 2005“…In this project, TSP will be used to model and easy visualize the path optimization problem and Genetic Algorithm (GA) was chosen to be implemented in resolving the problem. …”
Get full text
Get full text
Final Year Project -
15
Enhancement of Ant System Algorithm for Course Timetabling Problem
Published 2009“…As the requirement of the Ant System Algorithm, the problem is modeled as a graph that can be used by the ant to deliver its pheromone. …”
Get full text
Get full text
Get full text
Thesis -
16
Jogging activity recognition using k-NN algorithm
Published 2022“…Jogging activity recognition using the k-NN algorithm is a system that can help users collect information data of user speed movement using speed sensor and give the classification of jogging activity to the user. …”
Get full text
Get full text
Get full text
Academic Exercise -
17
All-pass filtered x least mean square algorithm for narrowband active noise control
Published 2018“…Most available ANC uses the secondary path modelling including filtered x least mean square (FxLMS) algorithm. …”
Get full text
Get full text
Get full text
Get full text
Article -
18
Development of low power viterbi decoder on complex programmable logic device platform
Published 2018“…For the path metric updater unit (PMU), the traditional method of Viterbi algorithm is to store the selected minimum value of branch metric in the memory unit. …”
Get full text
Get full text
Get full text
Thesis -
19
Optimal power flow using hybrid firefly and particle swarm optimization algorithm
Published 2020“…In this work, five objective functions of OPF problems are studied to prove the strength of the proposed method: total generation cost minimization, voltage profile improvement, voltage stability enhancement, the transmission lines active power loss reductions, and the transmission lines reactive power loss reductions. …”
Get full text
Get full text
Get full text
Article -
20
Gps solution for active queue management using android platform
Published 2021“…Since queueing in different locations is considered as a optimisation problem, several algorithms are reviewed to tackle the problem, such as brute force method, nearest neighbour algorithm, and branch and bound algorithm. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis
