Search Results - (( based evaluation drops algorithm ) OR ( motion estimation swarm algorithm ))*
Search alternatives:
- based evaluation »
- evaluation drops »
- swarm algorithm »
-
1
Hexagon pattern particle swarm optimization based block matching algorithm for motion estimation / Siti Eshah Che Osman
Published 2019“…Block Matching Algorithm (BMA) is a technique used to minimize the computational complexity of motion estimation in video coding application. …”
Get full text
Get full text
Thesis -
2
MARKERLESS ARTICULATED HUMAN MOTION TRACKING USING HIERARCHICAL MULTI-SWARM COOPERATIVE PARTICLE SWARM OPTIMIZATION
Published 2016“…Most recently. the swarm-intelligence based PSO algorithm have been gaining momentum in this tield.…”
Get full text
Get full text
Thesis -
3
A review on particle swarm optimization algorithm and its variants to human motion tracking
Published 2014“…The goal of human motion capture is to estimate the joints angles of human body at any time. …”
Get full text
Get full text
Article -
4
SLOW DRIFT MOTIONS IDENTIFICATION OF FLOATING STRUCTURES USING TIME-VARYING INPUT -OUTPUT MODELS
Published 2015“…The first step is presenting the backward estimator and combined forward-backward estimator instead of the only forward estimator in the original input-output models; the second step is reformulating the input-output models into a state-space model so that the Kalman Smoother (KS) adaptive filter can be used to estimate the model coefficients; the third step is optimization of KS parameters using evolutionary computing algorithms such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA) and Artificial Bee Colony (ABC) to form the PSO-KS, GA-KS and ABC-KS as estimation methods.…”
Get full text
Get full text
Thesis -
5
Non-probabilistic approach to cooperative position tracking in large swarm of simple mobile robots using triangular cross-observation
Published 2013“…Unfortunately, many of the most popular approaches for cooperative localization in literature today are probabilistic, which are computationally complex and less tolerant to any deviation from their predetermined probabilistic motion and observation models. This research focuses on devising a computationally simpler non-probabilistic cooperative position tracking algorithm specifically for a large swarm of simple mobile robots with the purpose of reducing the error accumulation in the position estimates of an individual robot due to noise in odometric measurement. …”
Get full text
Get full text
Thesis -
6
-
7
Neighbour-based on-demand routing algorithms for mobile ad hoc networks
Published 2017“…The dropping decision of the redundant RREQ in the NCPR algorithm completely relies on preset variables, such variables require to be set by the system administrator based on the scenario. …”
Get full text
Get full text
Get full text
Thesis -
8
Markov-modulated Bernoulli-based performance analysis for BLUE algorithm under bursty and correlated traffics
Published 2024Conference Paper -
9
Enhanced Intelligent Water Drops Algorithm for University Examination Timetabling Problems
Published 2024“…This thesis presents an investigation of using the Intelligent Water Drops (IWD) algorithm to construct and produce good quality solutions for the UETP. …”
thesis::doctoral thesis -
10
Markov-modulated Bernoulli-based Performance Analysis for BLUE Algorithm under Bursty and Correlated Traffics
Published 2024“…The MMBP is used to replace the conventional and widely-used Bernoulli process (BP) in evaluating and proposing analytical models based on the BLUE algorithm. …”
Proceedings Paper -
11
Time based internet traffic policing and shaping with Weibull traffic model / Mohd Azrul Abdullah
Published 2015“…Two important Weibull parameters which are shape and scale are measured. Based on the identified statistical parameters, a new Time Based Policing and Shaping algorithm is developed and simulated. …”
Get full text
Get full text
Article -
12
Time based internet traffic policing and shaping with Weibull traffic model / Mohd Azrul Abdullah
Published 2015“…Two important Weibull parameters which are shape and scale are measured. Based on the identified statistical parameters, a new Time Based Policing and Shaping algorithm is developed and simulated. …”
Get full text
Get full text
Thesis -
13
Vehicle pick-up and drop-off schedule optimization in a university setting
Published 2024“…A simulated annealing-based multi-directional iterative local search algorithm is employed for solution optimization. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
14
Performance evaluation of corner effect in UMTS / Nurzaliza Ghazali
Published 2009“…In cellular network such as UMTS, corner effect is one of the problem that effected the performance evaluation of handover algorithms. Handover is one of the key functionalities which tries to keep a user equipment (UE) connected to the best base station (Node B). …”
Get full text
Get full text
Thesis -
15
-
16
Immune-based technique for undergraduate programmes recommendation / Muhammad Azrill Mohd Zamri
Published 2017“…A framework for the immune-based technique is discovered in this study. Based on the framework, a prototype was implemented to evaluate the accuracy of the proposed technique. 52% is the highest accuracy obtained from the technique by using ten-fold cross validation. …”
Get full text
Get full text
Thesis -
17
-
18
CHID : conditional hybrid intrusion detection system for reducing false positives and resource consumption on malicous datasets
Published 2017“…CHID applied attribute wrapper features evaluation algorithms that marked malicious flows for further analysis by the packet-based detection. …”
Get full text
Get full text
Get full text
Thesis -
19
Data dissemination in VANETs using clustering and probabilistic forwarding based on adaptive jumping multi-objective firefly optimization
Published 2022“…The metrics to be incorporated in the multi-objective optimizations are the packet delivery ratio (PDR), the end-to-end delay (E2E-delay) and the number of dropped packets. Comparing both AJ-MOFA and CFM with benchmarks using multi-objective optimization and networking metrics reveals the superiority in most evaluation measures, which makes them promising algorithms for data dissemination in VANETs. …”
Get full text
Get full text
Article -
20
Benchmark simulator with dynamic environment for job scheduling in grid computing
Published 2014“…Characteristics of jobs and resources to be used in evaluating the performance of the scheduling algorithm must reflect the dynamic nature of real grid environment.Static models of jobs and resources cannot be used to generate jobs and resources in simulating the grid environment because of the dynamic nature of the grid.This paper presents a new graph representation of jobs and resources which is practical for hybrid metaheuristic model implementation such as ant colony optimization and genetic algorithm.A dynamic model that can generate jobs and resources similar to the jobs and resources in the real grid environment is also proposed.Jobs and resources may join in or drop out from the grid.Stochastic analysis is performed on the characteristics of jobs and resources.A simulator based on the dynamic expected time to compute, has been developed and can be used as a benchmark.The simulator can generate jobs and resources with the characteristics of jobs and resources in the real grid environment.This will facilitates the evaluation of dynamic job scheduling algorithm.…”
Get full text
Get full text
Get full text
Conference or Workshop Item
