Search Results - (( java application based algorithm ) OR ( using low (problems OR problem) algorithm ))

Parallel distributed genetic algorithm development based on microcontrollers framework by Krishnan P.S., Kiong T.S., Koh J.

“…Genetic algorithms are powerful optimizing techniques that are used successfully to solve problems in many different disciplines. …”

Batch mode heuristic approaches for efficient task scheduling in grid computing system by Maipan-Uku, Jamilu Yahaya

“…We simulate our proposed algorithms using a Java based simulator that is purposedly built for Grid computing simulations. …”
Get full text
Get full text
Get full text

Web-based expert system for material selection of natural fiber- reinforced polymer composites by Ahmed Ali, Basheer Ahmed

“…Finally, the developed expert system was deployed over the internet with central interactive interface from the server as a web-based application. As Java is platform independent and easy to be deployed in web based application and accessible through the World Wide Web (www), this expert system can be one stop application for materials selection.…”
Get full text
Get full text

Comparative Analysis of Low Discrepancy Sequence-Based Initialization Approaches Using Population-Based Algorithms for Solving the Global Optimization Problems by Waqas Haider Bangyal, Kashif Nisar, Ag. Asri Bin Ag. Ibrahim, Muhammad Reazul Haque, Joel J. P. C. Rodrigues, Danda B. Rawat

“…Metaheuristic algorithms have been widely used to solve diverse kinds of optimization problems. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Optimization and discretization of dragonfly algorithm for solving continuous and discrete optimization problems by Bibi Amirah Shafaa, Emambocus

“…Furthermore, the original DA is only suitable for solving continuous optimization problems. Although there is a binary version of the algorithm, it cannot be directly used for solving discrete optimization problems like the Traveling Salesman Problem (TSP). …”
Get full text
Get full text

Travelling Salesman Problem using Prim Algorithm in High Performance Computing by Wan Harun, Wan Nurhafizah

“…TSP has been used in The Two-Period Travelling Salesman Problem Applied to Milk Collection in Ireland and Usefulness of Solution Algorithms of the Travelling Salesman Problem in the typing of Biological Sequences in a Clinical Laboratory Setting.…”
Get full text
Get full text

Controlling algorithm for energy consumption of radio bandwidth to manage coverage area problem by Marsal K.A., Abdullah I.

Low and high level hybridization of ant colony system and genetic algorithm for job scheduling in grid computing by Alobaedy, Mustafa Muwafak, Ku-Mahamud, Ku Ruhana

“…Hybrid metaheuristic algorithms have the ability to produce better solution than stand-alone approach and no algorithm could be concluded as the best algorithm for scheduling algorithm or in general, for combinatorial problems.This study presents the low and high level hybridization of ant colony system and genetic algorithm in solving the job scheduling in grid computing.Two hybrid algorithms namely ACS(GA) as a low level and ACS+GA as a high level are proposed.The proposed algorithms were evaluated using static benchmarks problems known as expected time to compute model. …”
Get full text
Get full text
Get full text

Multi-objective service restoration in distribution networks using genetic algorithm by Moazami, Ehsan

“…This thesis presents a new approach of supply restoration service using the Genetic Algorithm. The GA is robust in searching a global optimal solution for the large-scale combinatorial optimization problems. …”
Get full text
Get full text

RSA Encryption & Decryption using JAVA by Ramli, Marliyana

“…The implementation of this project will be based on Rapid Application Design Methodology (RAD) and will be more focusing on research and finding, ideas and the implementation of the algorithm, and finally running and testing the algorithm. …”
Get full text
Get full text

Low-level hybridization scripting language with dynamic parameterization in PSO-GA / Suraya Masrom by Masrom, Suraya

“…The codes of the scripting language are shown to easily use, concisely describe the algorithm in a directly publishable form and flexible for new problem creations. …”
Get full text
Get full text

Mathematical models and optimization algorithms for low-carbon Location-Inventory-Routing Problem with uncertainty by Liu, Lihua

“…This thesis also aims to solve the low-carbon LIRP model with uncertainty factors such as carbon trading, customer demand, shortages, and soft time windows using advanced algorithms. …”
Get full text
Get full text
Get full text

INNOVATIVE METHODOLOGY AND ALGORITHMS FOR SOLVING GEOPHYSICAL INVERSE PROBLEMS by PRAJAPATI, SRICHAND

“…The proposed methodologies and algorithms are based on full-waveform inversion and contribute to this largely unsolved problem. …”
Get full text
Get full text

Formulating new enhanced pattern classification algorithms based on ACO-SVM by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…ACO originally deals with discrete optimization problem.In applying ACO for solving SVM model selection problem which are continuous variables, there is a need to discretize the continuously value into discrete values.This discretization process would result in loss of some information and hence affects the classification accuracy and seeking time.In this algorithm we propose to solve SVM model selection problem using IACOR without the need to discretize continuous value for SVM.The second algorithm aims to simultaneously solve SVM model selection problem and selects a small number of features.SVM model selection and selection of suitable and small number of feature subsets must occur simultaneously because error produced from the feature subset selection phase will affect the values of SVM model selection and result in low classification accuracy.In this second algorithm we propose the use of IACOMV to simultaneously solve SVM model selection problem and features subset selection.Ten benchmark datasets were used to evaluate the proposed algorithms.Results showed that the proposed algorithms can enhance the classification accuracy with small size of features subset.…”
Get full text
Get full text
Get full text

Optimization Of Pid Controller Using Grey Wolf Optimzer And Dragonfly Algorithm by Nik Mohamed Hazli, Nik Muhammad Aiman

“…In this research, swarming intelligence is used to solve optimisation problem. Grey Wolf Optimizer and Dragonfly Algorithm were chosen. …”
Get full text
Get full text

A new high order algorithm with low computational complexity for electric field simulation by Mohammad Khatim Hasan, Jumat Sulaiman, Samsul Ariffin Abdul Karim

“…Research efforts to increase the speed of simulating the problem are needed. Approach: Our recent research had found a new method with lower complexity and can simulate the problem faster than the existing FDTD algorithm. …”
Get full text
Get full text

A New High Order Algorithm With Low Computational Complexity for Electric Field Simulation by HASAN, KHATIM, SULAIMAN, JUMAT, ABDUL KARIM, SAMSUL ARIFFIN

“…Research efforts to increase the speed of simulating the problem are needed. Approach: Our recent research had found a new method with lower complexity and can simulate the problem faster than the existing FDTD algorithm. …”
Get full text
Get full text

A Comparative Study on three Component Selection Mechanisms for Hyper-Heuristics in Expensive Optimization by Jia Hui Ong, Jason Teo

“…Numerous studies in optimization problems often lead to tailoring a specific algorithm to adapt to the problem instances, especially in expensive optimization problems. …”
Get full text
Get full text
Get full text

Efficient radio resource management algorithms for downlink long term evolution networks by Mamman, Maharazu

“…The algorithm is based on the idea of the optimization problem in which resource allocation problem is formulated as an optimization problem. …”
Get full text
Get full text

Design Of Perturbative Hyper-Heuristics For Combinatorial Optimisation by Choong, Shin Siang

“…However, exact algorithms are not feasible for solving complex problem due to its high computational overhead. …”
Get full text
Get full text