Search Results - (( using simulation method algorithm ) OR ( based evaluation path algorithm ))
Search alternatives:
- simulation method »
- method algorithm »
- based evaluation »
- evaluation path »
- path algorithm »
-
1
Wide area measurement system in the IEEE-14 bus system using multiobjective shortest path algorithm for fault analysis
Published 2021“…The IEEE-14 bus system was modeled in PSCAD software for simulating nineteen types of fault based on multi-objective shortest path algorithm. …”
Get full text
Get full text
Get full text
Article -
2
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 -
3
Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques
Published 2014“…Experiments via WEKA tool and simulation prototype were conducted to evaluate the methods used. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
4
Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed
Published 2017“…Case study evaluation was conducted based on three industrial open source case studies in order to evaluate empirically the significant of the performance of the proposed method. …”
Get full text
Get full text
Get full text
Thesis -
5
Performance evaluation of heuristic methods in solving symmetric travelling salesman problems
Published 2016“…The purpose of this study is to carry out a comparative evaluation study on Simulated Annealing (SA) and several variation of Tabu Search (TS).Materials and Method: This study considers four heuristic methods, i.e., Simulated Annealing (SA), conventional Tabu Search (TS), Improved Tabu Search (ITS) and modified Reactive Tabu Search (RTS) to solve symmetric TSPs.The algorithms were tested on five chosen benchmark problems. …”
Get full text
Get full text
Get full text
Article -
6
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 -
7
Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms
Published 2008“…The simulation results indicate that the algorithm is able to segregate and assign the tasks for each scanning head and also able to find the shortest scanning path for different types of objects coordination. …”
Get full text
Get full text
Thesis -
8
-
9
Real time nonlinear filtered-x lms algorithm for active noise control
Published 2012“…Subsequently, the THF modelling scheme can be incorporated into an established real time NLFXLMS algorithm termed THF-NLFXLMS algorithm. The developed THF-NLFXLMS algorithm is tested by means of simulation and implemented experimentally using FPGA-based real time controller for a nonlinear ANC application. …”
Get full text
Get full text
Thesis -
10
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 -
11
A comparative study of heuristic methods to solve Traveling Salesman Problem (TPS)
Published 2011“…RTS is an improved method of TS and it dynamically adjusts tabu list size based on how the search is performed.The performance of SA, TS and RTS algorithms in solving TSP with different size of problems are evaluated by using empirical testing, benchmarking solution and simple probabilistic analysis. …”
Get full text
Get full text
Get full text
Monograph -
12
Genetic algorithm based network coding in wireless ad hoc networks
Published 2013“…In this work, an adaptive genetic algorithm based coding-aware routing (AGACAR) is also proposed to improve the solution on the GACAR. …”
Get full text
Get full text
Get full text
Thesis -
13
Node Participation Evaluation Scheme Based on Link Quality for Energy Efficient Routing in Ad-hoc Networks
Published 2016“…Computer simulations using NS-2 simulator are performed with comparison to the conventional methods and the effectiveness of the proposed methods is quantitatively validated. …”
Get full text
Get full text
Thesis -
14
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 -
15
On-chip communication system modeling approach for reability analysis focusing on functional failures
Published 2012“…This research also investigates the tradeoff between accuracy and computational cost in crosstalk modeling as a part of the modeling approach which has critical impact on the total simulation precision and computational cost. Two algorithms are proposed to control the crosstalk simulation error while minimizing the required computational cost.An adaptive modeling window sizing method, along with an upper bound on the sampling error were applied to guarantee a high order of precision in simulating the crosstalk noise for an RLC interconnect model. …”
Get full text
Get full text
Thesis -
16
Optimization Method Using Modified Harmony Search For Coverage And Energy Efficiency In Wireless Sensor Network
Published 2018“…However,the sink node position and size of data transmitted will not affect the performance of coverage area.This is because the coverage area value is fluctuated as the parameters value increases.Throughout the experiment conducted,sensor nodes deployed using Modified Harmony Search algorithm (MHS) gives better coverage area compared to other existing methods.The average coverage area percentage obtained by Modified Harmony Search is 63 %.The average coverage area percentage obtained by Modified Random is 48 % and the average coverage area percentage obtained by Harmony Search is 46 %.The highest coverage area recorded for Modified Harmony Search is 70 %.To enhance the energy efficiency,shortest path distance finder is added to each method.Throughout the research,Modified Harmony Search with shortest path distance finder gives optimum results.…”
Get full text
Get full text
Get full text
Get full text
Thesis -
17
Modeling and control of a Pico-satellite attitude using Fuzzy Logic Controller
Published 2010“…It is observed that the APFLC showed convincing performance over the entire simulation of the Pico-satellite. Genetic Algorithm (GA) is a computational model inspired by evaluation. …”
Get full text
Thesis -
18
Design of A unmanned aerial vehicles assisted search and rescue collaboration architecture for emergency communication systems / Abdu Ahmed Saif Ahmed
Published 2022“…The multi-UAV and SAR collaboration have been evaluated based on average capacity, energy efficiency, line-of-sight probability, path loss, throughput performance, coverage probability analysis and outage probability performance. …”
Get full text
Get full text
Get full text
Thesis -
19
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 -
20