Search Results - (( java implication based algorithm ) OR ( based simulation drops algorithm ))

Solving university examination timetabling problem using intelligent water drops algorithm by Aldeeb B.A., Norwawi N.M., Al-Betar M.A., Jali M.Z.B.

Neighbour-based on-demand routing algorithms for mobile ad hoc networks by Ejmaa, Ali Mohamed E.

“…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

Hybrid Intelligent Water Drops Algorithm For Examination Timetabling Problem by Bashar A.Aldeeb, Mohammed Azmi Al-Betar, Norita Md Norwawi, Khalid A.Alissa, Mutasem K.Alsmadi, Ayman A.Hazaymeh, Malek Alzaqebah

Investigation of throughput and packet drop for Hata model on VANET using NCTUns simulation software for open area and suburban area / Rosmawani Samsudin by Samsudin, Rosmawani

“…The performance measurements are based on the various parameters of in-out throughput and number of packet dropped.…”
Get full text
Get full text

Solving University Examination Timetabling Problem Using Intelligent Water Drops Algorithm by Aldeeb, BA, Norwawi, NM, Al-Betar, MA, Bin Jali, MZ

“…IWD is a recent metaheuristic population-based algorithm belonging to swarm intelligent category which simulate river system. …”

Mathematical modelling of mass transfer in a multi-stage rotating disc contactor column by Maan, Normah

“…This derivation initiated the formulation of the modified quadratic driving force, called Time-dependent Quadratic Driving Force (TQDF). Based on this formulation, a Mass Transfer of A Single Drop (MTASD) Algorithm was designed, followed by a more realistic Mass Transfer of Multiple Drops (MTMD) Algorithm which was later refined to become another algorithm named the Mass Transfer Steady State (MTSS) Algorithm. …”
Get full text
Get full text

Vehicle pick-up and drop-off schedule optimization in a university setting by Teo, Chun Kit

“…Lateness will be removed using a lateness waiting time rollback mechanism. A simulated annealing-based multi-directional iterative local search algorithm is employed for solution optimization. …”
Get full text
Get full text

Benchmark simulator with dynamic environment for job scheduling in grid computing by Ku-Mahamud, Ku Ruhana

“…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

Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

“…In this research, two novel estimation-based metaheuristic optimization algorithms, named as Simulated Kalman Filter (SKF), and single-solution Simulated Kalman Filter (ssSKF) algorithms are introduced for global optimization problems. …”
Get full text
Get full text

Mathematical modelling of mass transfer in multi-stage rotating disc contactor column by Arshad, Khairil Anuar, Talib, Jamalludin, Maan, Normah

“…This derivation initiated the formulation of the modi¯ed quadratic driving force, called Time-dependent Quadratic Driving Force (TQDF). Based on this formulation, a Mass Transfer of A Single Drop (MTASD) Algorithm was designed, followed by a more realistic Mass Transfer of Multiple Drops (MTMD) Algorithm which was later re¯ned to become another algorithm named the Mass Transfer Steady State (MTSS) Algorithm. …”
Get full text
Get full text
Get full text

Enhanced Intelligent Water Drops Algorithm for University Examination Timetabling Problems by Bashar AbedAl Mohdi Talal AlDeeb

“…The IWD is a recent metaheuristic population-based algorithm belonging to the swarm intelligent category which simulates the dynamic of the river systems. …”

A comparative study and simulation of object tracking algorithms by Ji, Yuanfa, Yin, Pan, Sun, Xiyan, Kamarul Hawari, Ghazali, Guo, Ning

“…This article introduces the popular object tracking algorithms, from common problems in object tracking to the classification of algorithms: Early classic trackingalgorithms, tracking algorithms based on kernel correlation filtering, and tracking algorithms based on deep learning. …”
Get full text
Get full text
Get full text

Time based internet traffic policing and shaping with Weibull traffic model / Mohd Azrul Abdullah by Abdullah, Mohd Azrul

“…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

An enhanced cluster head selection algorithm for routing in mobile AD-HOC network by Abdulsaheb, Ghaida Muttasher

“…The performance of ECRP algorithms was compared with other cluster based algorithms. …”
Get full text
Get full text

A Grid-Based Reliable Routing (GBRR) protocol for wireless sensor networks by Jiang, Cailing

“…In this research, collaborated with clustering and grid-based routing features, the proposed protocol uses a combination of clustering protocols and geographical protocols with greedy algorithm to accomplish the scalability and adaptability of the randomly deployed sensor networks in a dense and large-scale network. …”
Get full text
Get full text

A simulation study of a new rate-and-queue-based active queue management algorithm by Ali Asghar, Jomah Adham, Razman, Mat Tahar

Get full text
Get full text
Get full text
Get full text

Dijkstra’s Algorithm for optimal recyclable waste collection system in Port Dickson / Nur Jazlina Mohd Iszairi, Aina Zulaika Md Ramli and Nursabrina Saifulbahri by Mohd Iszairi, Nur Jazlina, Md Ramli, Aina Zulaika, Saifulbahri, Nursabrina

“…The data are collected from Google Map and are applied in Excel Solver using the Dijkstra’s Algorithm. Based on the simulation conducted, the results show the optimal route for the recyclable waste collection with minimum travel distance where the travel distance from Depot to C13 is 2386 meters, from C13 to D42 is 2555 meters and from D42 back to the Depot is 2407 meters. …”
Get full text
Get full text

Time based internet traffic policing and shaping with Weibull traffic model / Mohd Azrul Abdullah by Abdullah, Mohd Azrul

“…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

Quality of service management algorithms in WiMAX networks by Saidu, Ibrahim

“…Simulation have been extensively used to evaluate the proposed algorithm. …”
Get full text
Get full text

Markov-modulated Bernoulli-based performance analysis for BLUE algorithm under bursty and correlated traffics by Saaidah A.M., Jali M.Z., Marhusin M.F., Abdel-Jaber H.