Search Results - (( java implementation tree algorithm ) OR ( using simulation drops algorithm ))
Search alternatives:
- java implementation »
- implementation tree »
- simulation drops »
- tree algorithm »
-
1
Study and Implementation of Data Mining in Urban Gardening
Published 2019“…Using the J48 tree algorithm implemented through WEKA API on a Java Servlet, data provided is processed to derive a health index of the plant, with the possible outcomes set to “Good,” “Okay”, or “Bad”. …”
Get full text
Get full text
Get full text
Article -
2
IWDSA: a hybrid Intelligent Water Drops with a Simulated Annealing for the localization improvement in wireless sensor networks
Published 2024“…The proposed algorithm, named Intelligent Water Drops with Simulated Annealing (IWDSA), combines two powerful optimization methods: Intelligent Water Drops (IWD) and Simulated Annealing (SA). …”
Get full text
Get full text
Get full text
Article -
3
Investigation of throughput and packet drop for Hata model on VANET using NCTUns simulation software for open area and suburban area / Rosmawani Samsudin
Published 2012“…The purpose of this project is to run VANET using National Chiao Tung University network simulator (NCTUns). …”
Get full text
Get full text
Thesis -
4
Solving university examination timetabling problem using intelligent water drops algorithm
Published 2024Conference Paper -
5
Adoption of machine learning algorithm for analysing supporters and non supporters feedback on political posts / Ogunfolajin Maruff Tunde
Published 2022“…The method was implemented using Java and the results of the simulation were evaluated using five standard performance metrics: accuracy, AUC, precision, recall, and f-Measure. …”
Get full text
Get full text
Get full text
Thesis -
6
Solving University Examination Timetabling Problem Using Intelligent Water Drops Algorithm
Published 2024“…IWD is a recent metaheuristic population-based algorithm belonging to swarm intelligent category which simulate river system. …”
Proceedings Paper -
7
Neighbour-based on-demand routing algorithms for mobile ad hoc networks
Published 2017“…All the three proposed algorithms are evaluated using discrete event simulation, in particular Network Simulator tool (NS2), and compared with the latest routing algorithm (NCPR ) and fundamental algorithm (AODV) using five performance metrics. …”
Get full text
Get full text
Get full text
Thesis -
8
Simulation of single and dual layered rapid pressure swing adsorption
Published 2013“…The Muller hybrid algorithm is found to achieve CSS faster and is then adopted for the simulation of RPSA for air separation. …”
Get full text
Get full text
Thesis -
9
RED, GRED, AGRED congestion control algorithms in heterogeneous traffic types
Published 2013“…The performance metric used to show the analysis of these algorithms with mentioned distributions is Packet Loss (Pl).Results of simulation show that each algorithm performed a fair dropping of data packets without considering of their types.…”
Get full text
Get full text
Get full text
Conference or Workshop Item -
10
Mathematical modelling of mass transfer in a multi-stage rotating disc contactor column
Published 2005“…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
Thesis -
11
Red, gred, agred congestion control algorithms in heterogeneous traffic types
Published 2013“…Results of simulation show that each algorithm performed a fair dropping of data packets without considering of their types.…”
Get full text
Get full text
Get full text
Conference or Workshop Item -
12
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 -
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
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 -
15
Performance Comparison of Packet Queuing Algorithm in Wireless Networks
Published 2014“…Therefore, a good strategy of packet queuing algorithm is very important to avoid packets drop. …”
Get full text
Get full text
Article -
16
Performance Comparison of Packet Queuing Algorithm in Wireless Networks
Published 2014“…Therefore, a good strategy of packet queuing algorithm is very important to avoid packets drop. …”
Get full text
Get full text
Conference or Workshop Item -
17
Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization
Published 2019“…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
Get full text
Get full text
Thesis -
18
A comparative study and simulation of object tracking algorithms
Published 2020“…The algorithms using convolution features and multi-features fusion algorithms have more advantages in tracking accuracy than the algorithm using a single feature, but the tracking speed will also drop rapidly. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
19
Dijkstra’s Algorithm for optimal recyclable waste collection system in Port Dickson / Nur Jazlina Mohd Iszairi, Aina Zulaika Md Ramli and Nursabrina Saifulbahri
Published 2023“…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
Student Project -
20
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…The proposed population-based SKF algorithm and the single solution-based SKF algorithm use the scalar model of discrete Kalman filter algorithm as the search strategy to overcome these flaws. …”
Get full text
Get full text
Thesis
