Search Results - (( java implementation tree algorithm ) OR ( causing problem _ algorithm ))

Study and Implementation of Data Mining in Urban Gardening by Mohana, Muniandy, Lee, Eu Vern

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

Adoption of machine learning algorithm for analysing supporters and non supporters feedback on political posts / Ogunfolajin Maruff Tunde by Ogunfolajin Maruff , Tunde

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

Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

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

A refined differential evolution algorithm for improving the performance of optimization process by A. R., Yusoff, Nafrizuan, Mat Yahya

“…Various Artificial Intelligent (AI) algorithms can be applied in solving optimization problems. …”
Get full text
Get full text
Get full text

Automatic clustering of gene ontology by genetic algorithm by Othman, Razib M., Deris, Safaai, Zakaria, Zalmiyah, Illias, Rosli M., Mohamad, Saberi M.

“…However, the increase in size of the Gene Ontology has caused problems in maintaining and processing them. …”
Get full text
Get full text

Tolerable Constructive Graph-Based Hyper-Heuristic Algorithm For Examination Timetabling by Mohammad Pour, Shahrzad

“…In heuristic approaches getting stuck in local optimum is one of the propounded problems from early days. The main cause for the local optimal problem is that heuristic algorithms either focus on exploration (global improvement) rather than exploitation (local improvement) or vice versa.…”
Get full text
Get full text

A cause and effect of a nonpayment model based on the DEMATEL algorithm by Lee, Chia Kuang, Bujna, Marián, Ahmad Huzaimi, Abd Jamil, Ee, Pei Theng

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

An improved simulated annealing algorithm to avoid crosstalk in optical omega network by Abdullah, Monir, Othman, Mohamed, Johari, Rozita

“…When Simulated Annealing (SA) algorithm was used to solve the problem, it gave good results. …”
Get full text
Get full text

A novel layer by layer energy efficient watchman algorithm for wireless sensor and actor networks by Draz, U., Ali, T., Yasin, S., Hussain, A., Bukhari, S., Nawaz, A., Ali, A., Khan, M.S., Jung, L.T.

“…Energy consumption, end-to-end delay, and throughput are considered for the evaluation of the proposed algorithm. At the end, the proposed algorithm is compared with an existing state-of-the-art algorithm like the Efficient Traffic Load Reduction Algorithm (ETLRA) that also works with limbs node for the said problem in the same kind of wireless environment. …”
Get full text
Get full text

Festive season balancing groceries optimization / Fairuz Mohamed Razi by Mohamed Razi, Fairuz

“…An Artificial Intelligence method or technique is selected to provide a solution to this problem. The cause of the shortage in supply-demand is taken to be implemented in the Genetic Algorithms optimization concepts. …”
Get full text
Get full text

Heuristic-Based Ant Colony Optimization Algorithm For Protein Functional Module Detection In Protein Interaction Network by SALLIM, JAMALUDIN

“…Ant colony optimization (ACO) is a metaheuristic algorithm that has been successfully applied to several types of optimization problems such as scheduling, routing, and more recently for solving protein functional module detection (PFMD) problem in protein-protein interaction (PPI) networks. …”
Get full text
Get full text

Heuristic-Based Ant Colony Optimization Algorithm For Protein Functional Module Detection In Protein Interaction Network by Sallim, Jamaludin

“…Ant colony optimization (ACO) is a metaheuristic algorithm that has been successfully applied to several types of optimization problems such as scheduling, routing, and more recently for solving protein functional module detection (PFMD) problem in protein-protein interaction (PPI) networks. …”
Get full text
Get full text

Minimizing makespan of a resource-constrained scheduling problem: a hybrid greedy and genetic algorithms by Mohd Ariffin, Mohd Khairol Anuar, Baharudin, B. T. Hang Tuah, Leman, Zulkiflle, Delgoshaei, Aidin

“…Resource-Constrained Project Scheduling Problem (RCPSP) is considered as an important project scheduling problem. …”
Get full text
Get full text
Get full text

Leader election algorithm in 2D torus networks with the presence of one link failure by Refai, M., Sharieh, A., Alshammari, F.

“…Leader election algorithms solve the instability problem in the network which is caused by leader failure. …”
Get full text

Zero Algorithms for Avoiding Crosstalk in Optical Multistage Interconnection Network by Ali Al-Shabi, Mohammed Abdulhameed

“…Under the constraint of avoiding crosstalk, the research interest is to realize a permutation that will use the minimum number of passes (to route the input request to output without crosstalk). This routing problem is an NP-hard problem. Many heuristic algorithms have been proposed and designed to perform the routing such as the sequential algorithm, the sequential down algorithm, the degree-ascending algorithm, the degree-descending algorithm, the Simulated Annealing algorithm and the Ant Colony algorithm. …”
Get full text
Get full text

Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network by Abduh Kaid, Monir Abdullah

“…Also an improved simulated annealing is proposed to solve the routing problem. The efficient combination of simulated annealing algorithm with the best heuristic algorithms gave much better result in a very minimal time. …”
Get full text
Get full text

Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem by Nurhazwani, Ahmad Razak

“…Capacitated Multi-source Weber Problem (CMSWP) is a type of Location Allocation Problem (LAP) which have been extensively researched because they can be applied in a variety of contexts. …”
Get full text
Get full text

Design of a flexible digital baseband signal processing algorithm by Mohamad, Rosalina, Harun, Harlisya, Nuzli, Mohamad Anas, Dimyati, Kaharudin

“…The work presented in this paper is aimed at designing a flexible digital baseband signal processing algorithm (DBSP) for satellite applications. In non-real-time application, there have been many examples or simulations of DBSP, written in C language but the problem is, most of them requires many loops to execute and hence, cause timing problem. …”
Get full text
Get full text

Three-term backpropagation algorithm for classification problem by Saman, Fadhlina Izzah

“…Standard Backpropagation Algorithm (BP) is a widely used algorithm in training Neural Network that is proven to be very successful in many diverse application. …”
Get full text
Get full text

Enhancing three variants of harmony search algorithm for continuous optimization problems by Alomoush, Alaa A., Alsewari, Abdulrahman A., Kamal Z., Zamli, Alrosan, Ayat, Alomoush, Waleed, Alissa, Khalid

“…Meta-heuristic algorithms are well-known optimization methods, for solving real-world optimization problems. …”
Get full text
Get full text
Get full text