Search Results - (( developing special optimization algorithm ) OR ( java implementation tree algorithm ))
Search alternatives:
- special optimization »
- java implementation »
- implementation tree »
- developing special »
- 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
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 -
3
Swarm intelligence optimization algorithms: a review
Published 2018“…This paper presents a review of some recently developed swarm intelligence algorithms that have been successfully applied to solve a number of optimization problems with special emphasis on their application areas, strengths and observable weaknesses. …”
Get full text
Get full text
Get full text
Article -
4
A hybrid SP-QPSO algorithm with parameter free adaptive penalty method for constrained global optimization problems
Published 2018“…This paper attempts the suitability of newly developed hybrid algorithm, Shuffled Complex Evolution with Quantum Particle Swarm Optimization abbreviated as SP-QPSO, extended specifically designed for solving constrained optimization problems. …”
Get full text
Get full text
Get full text
Article -
5
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 -
6
Quantum Particle Swarm Optimization Technique for Load Balancing in Cloud Computing
Published 2013“…Then they are assigned to the machines according to the assignment algorithm for job combinations, which is a special integer partition algorithm. …”
Get full text
Thesis -
7
Seed disperser ant algorithm for optimization / Chang Wen Liang
Published 2018“…The Seed Disperser Ant Algorithm (SDAA) is developed based on the evolution or expansion process of Seed Disperser Ant (Aphaenogaster senilis) colony. …”
Get full text
Get full text
Get full text
Thesis -
8
Wideband patch antenna design using selective particle swarm optimization
Published 2012“…An application of this algorithm is developed for wideband patch antenna optimization. …”
Get full text
Get full text
Get full text
Article -
9
Ant colony optimization (ACO) algorithm for CNC route problem
Published 2012“…This project is about to develop a software which applying ACO algorithm in order to calculate the shortest path available that can reduce the time taken to drill the entire hole of PCB. …”
Get full text
Get full text
Undergraduates Project Papers -
10
EFFICIENCY IMPROVEMENT OF FLAT PLATE SOLAR COLLECTOR USING SEARCH GROUP ALGORITHM
Published 2019“…This document proposes new optimization technique, the Search Group Algorithm (SGA), to optimize the efficiency of flat plate solar collector.…”
Get full text
Get full text
Final Year Project -
11
Alternative method for economic dispatch utilizing grey wolf optimizer
Published 2015“…Although several optimization methodologies have been developed for solving ED problems, the complexity of the task reveals the necessity for development of efficient algorithms to accurately locate the optimum solution. …”
Get full text
Get full text
Thesis -
12
Data Analysis and Machine Learning Algorithms Evaluation for Bioliq AI-based Predictive Tool
Published 2019“…This final year project identified relevant parameters through literature research, analysis and expert interview, and evaluated different machine learning algorithms and identified linear regression as the most applicable and efficient with its R-square of 0.8015, qualifying it to be used for the development of a hybrid model for the AI-based tool for predictive process optimization for chemical plants.…”
Get full text
Get full text
Final Year Project -
13
Mathematical formulation of tabu search in combinatorial optimization
Published 2008Get full text
Get full text
Monograph -
14
-
15
Application of Taylor-Newton homotopy method for solving electrical engineering design problem
Published 2010Get full text
Get full text
Get full text
Proceeding Paper -
16
CSC649 - Special Topics in Computer Science / College of Computing, Informatics and Media
Published 2022“…The course will cover specialized technology and described in terms of frameworks and problem formulations, standard models, methods, computational tools, algorithms, as well as methodologies to evaluate the system and select optimal models. …”
Get full text
Get full text
Get full text
Teaching Resource -
17
CSC649: Special Topics in Computer Science / College of Computing, Informatics and Mathematics
Published 2018“…The course will cover specialized technology and described in terms of frameworks and problem formulations, standard models, methods, computational tools, algorithms, as well as methodologies to evaluate the system and select optimal models. …”
Get full text
Get full text
Get full text
Teaching Resource -
18
Optimizing solar streetlight systems for sustainable urban and community development
Published 2025“…Additionally, a smart LED control algorithm was developed to minimize energy consumption by dynamically adjusting light output based on demand and availability of stored energy. …”
Get full text
Get full text
Get full text
Get full text
Article -
19
An Improved-Time Polynomial-Space Exact Algorithm For TSP In Degree-5 Graphs
Published 2017“…The Traveling Salesman Problem (TSP) is one of the most well-known NP-hard optimization problems. Following a recent trend of research which focuses on developing algorithms for special types of TSP instances, namely graphs of limited degree, in an attempt to reduce a part of the time and space complexity, we present a polynomial-space branching algorithm for the TSP in an n-vertex graph with degree at most 5, and show that it has a running time of O∗(2.3500n), which improves the previous best known time bound of O∗(2.4723n) given by the authors (the 12th International Symposium on Operations Research and Its Application (ISORA 2015), pp.45–58, 2015). …”
Get full text
Get full text
Get full text
Get full text
Article -
20
Heuristic approach to solution of unit commitment for electrical system / Azizan Harun
Published 1996“…This paper describes in general view of the algorithm developed for a unit commitment solution for electrical system. …”
Get full text
Get full text
Student Project
