Search Results - (( based constructive path algorithm ) OR ( using estimation path algorithm ))
Search alternatives:
- based constructive »
- constructive path »
- using estimation »
- estimation path »
- path algorithm »
-
1
Wi-Fi signal strengths database construction for indoor positioning systems using Wi-Fi RFID
Published 2013“…In this research we present a new approach of constructing fingerprint database. We propose a hybrid calibration procedure that combines signal sampling process with path-loss prediction algorithm. …”
Get full text
Get full text
Conference or Workshop Item -
2
Time-Uncertainty Analysis by Using Simulation in Project Scheduling Networks
Published 1999“…In this study, Monte Carlo simulation as a tool of risk analysis was used. The merge event bias as one of the essential problems associated with PERT is discussed, along with models and approaches developed by other researchers, namely, Probabilistic Network Evaluation Technique (PNET algorithm), Modified PNET, Back-Forward Uncertainly Estimation procedure (BFUE) and concept based on the robust reliability idea. …”
Get full text
Get full text
Thesis -
3
A Continuous Overlay Path Probing Algorithm For Overlay Networks
Published 2013“…Active measurement techniques performed by overlay nodes can provide bandwidth estimations of an end-to-end overlay path. This thesis describes a new algorithm called “COPPA,” which is an in-band path probing algorithm for measuring the end-to-end available bandwidth of an overlay path accurately and continuously. …”
Get full text
Get full text
Thesis -
4
A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments
Published 2013“…The motion planning problem poses the question of how a robot can move from an initial to a final position. Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
Get full text
Get full text
Thesis -
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
Analysis of Dijkstra’s and A* algorithm to find the shortest path
Published 2015“…There are so many algorithms used to find the shortest path such as Dijkstra, A* algorithm, Genetic algorithm, Floyd algorithm and Ant algorithm. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
7
-
8
Modeling of cardiovascular diseases (CVDs) and development of predictive heart risk score
Published 2021“…The warppartial least square method was utilized to estimate the multi-layer hypothesized path model. This model estimated warped coefficients using the overall linear trend found in linear segments of non-linear relationships. …”
Get full text
Get full text
Thesis -
9
Autonomous path planning robot using geographical information
Published 2008Get full text
Learning Object -
10
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…The algorithms are evaluated using 30 benchmark functions of the CEC2014 benchmark suite, and then applied to solve PCB drill path optimization case study. …”
Get full text
Get full text
Thesis -
11
A generalized laser simulator algorithm for optimal path planning in constraints environment
Published 2022“…The suggested algorithm outperforms the competition in terms of improving path cost, smoothness, and search time. …”
Get full text
Thesis -
12
-
13
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 -
14
Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff
Published 2011“…Finally, the performances of both algorithms were analyzed and evaluated based on the required criteria. …”
Get full text
Get full text
Thesis -
15
Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed
Published 2017“…A model-driven approach was used for generating abstract test cases from the feasible paths. This model driven approach was integrated with the proposed infeasible path detection method which based on analyzing various OCL constructs and operations. …”
Get full text
Get full text
Get full text
Thesis -
16
An application of Floyd-Warshall Algortihm in finding shortest path of order picker in warehouse / Saidatul Aisyah Roslan, Siti Norhakimah Mohd Yatim and Siti Sarah Sulaiman
Published 2019“…The objectives of this study are to construct the distance matrix and sequence matrix based on the network layout and to find the shortest path to collect the item in the warehouse. …”
Get full text
Get full text
Student Project -
17
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 -
18
GPS boundary navigation of DrosoBots using MATLAB simulation
Published 2010“…To implement this, region recognition and several path planning algorithms have been utilized. Besides that, pixilation of path is also used to estimate the coverage of the path planning. …”
Get full text
Get full text
Proceeding Paper -
19
AUTOMATED GUIDED ROBOT (AGR)
Published 2007“…Algorithm conversion to C code programming has been done throughout the project for the obstacle avoidance and path planning algorithms based upon the GA platform ofAI.…”
Get full text
Get full text
Final Year Project -
20
Shortest path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm / Nur Syuhada Muhammat Pazil ... [et al.]
Published 2020“…Moreover, Dijkstra algorithm is applied to find the shortest path. The shortest path is calculated by using C programming of Dev C++. …”
Get full text
Get full text
Get full text
Article