Search Results - (( using function ((a algorithm) OR (new algorithm)) ) OR ( basic selection methods algorithm ))

Master-leader-slave cuckoo search with parameter control for ANN optimization and its real-world application to water quality prediction by Jaddi N.S., Abdullah S., Malek M.A.

Backtracking search algorithm for optimal power dispatch in power system / Mostafa Modiri Delshad by Mostafa, Modiri Delshad

“…Backtracking search algorithm (BSA) as the new evolutionary technique of optimization is used for solving the problems. …”
Get full text
Get full text

Nomadic people optimizer (NPO) for large-scale optimization problems by Mohamd Salih, Sinan Qahtan

“…NPO provides two steps for exploitation part, while the exploration is performed using another step. The local search of NPO is implemented using a unique distribution formula, while the global search ability contains a levy flight equation which generates a step for moving the families towards the new positions. …”
Get full text
Get full text

Reproducing kernel Hilbert space method for cox proportional hazard model by Abdul Manaf, Nur'azah

“…This algorithm is used to determine the vector i a that enables us to find the optimal parameters of ƒ(x)which is simplified as F(x)= ∑aᵢK(x,xᵢ) . …”
Get full text
Get full text
Get full text

An Environmentally Energy Dispatch Using New Meta Heuristic Evolutionary Programming by Mohamad Ridzuan, Mohamad Radzi

“…Basically,one important issue in the power system network is to provide the optimal Economic Load Dispatch (ELD) solution in order to guarantee the sustainable consumer load demand.However,today ELD solution is essential to include together with the environmental aspect and known as Environmental Economic Load Dispatch (EELD).For that reason, many researchers continue in the development of new simulation tool specifically to overcome the EELD problems.Therefore,this study prepared an improved hybrid metaheuristic technique named as New Meta Heuristic Evolutionary Programming (NMEP) to provide the best possible solution in solving the identified single objective and multi objective functions for EELD solution.This new technique a merging cloning strategy that involved in an Artificial Immune System (AIS) algorithm into algorithm of Meta Heuristic Evolutionary Programming (Meta-EP).The development of NMEP technique is to minimize total cost,reduce the total emission during generator operation through the common formula in EELD and lowest total system loss.Besides that,all mentioned objective functions were also optimized together simultaneously that formulated using the weighted sum method before had been executed on the multi objective NMEP or called MONMEP.Both individual and multi objective NMEP techniques performance were verified among other two common heuristic methods known as AIS and Meta-EP techniques.In addition,the best possible solution defined using the aggregate function method.Through this method,the selection of the best MOEELD solution became effortless as compared with MO individually that required compare two or more objective function in one time manually.Among those three optimization techniques the lowest total aggregate values mostly resulted via the NMEP technique.Based upon that,the proposed technique is proving as the outstanding method compared with Meta-EP and AIS techniques in solving the EELD problem for both standard IEEE 26 bus and 57 bus systems.…”
Get full text
Get full text
Get full text
Get full text

Twofold Integer Programming Model for Improving Rough Set Classification Accuracy in Data Mining. by Saeed, Walid

“…The first task is to introduce a new rough model for minimum reduct selection and default rules generation, which is known as a Twofold Integer Programming (TIP). …”
Get full text
Get full text

Improving Attentive Sequence-to-Sequence Generative-Based Chatbot Model Using Deep Neural Network Approach by Wan Solehah, Wan Ahmad

“…The strategies applied showed that the final accuracy obtained through the training after implementing a modification in the algorithm is at 81% accuracy rate compared to the basic model that recorded its final accuracy at 79% accuracy rate. …”
Get full text
Get full text
Get full text
Get full text

A block cipher based on genetic algorithm by Zakaria, Nur Hafiza

“…In many algorithms which are based on the genetic algorithm approach, diffusion properties using crossover and mutation function are being generated to produce a secure data transmission. …”
Get full text
Get full text
Get full text

The development of semantic meta-database: an ontology based semantic integration of biological databases by Samsudin, Ruhaidah, Deris, Safaai, Othman, Muhammad Razib, Md. Illias, Rosli

“…The tool comprises two intelligent algorithms. The first algorithm combines parallel genetic algorithm with the split-and-merge algorithm. …”
Get full text
Get full text

Gravitational search – bat algorithm for solving single and bi-objective of non-linear functions by Abbas, Iraq Tareq

“…The second technique is to solve bi-objective functions by using the BOBAT algorithm. The third technique is an integration of BOGSA with BOBAT to produce a BOGSBAT algorithm. …”
Get full text
Get full text

Improving neural networks training using experiment design approach by Chong, Wei Kean

“…Consider a function approximation problem (Neural Network using Radial Basic Function structure) and limit the amount of training data, say (m) from N amount of possible data. …”
Get full text
Get full text

FaaSBid: an auction-based model for Function as a Service in edge-fog environments using unallocated resources by Al-Qadhi, Abdulrahman K., Athauda, Rukshan, Latip, Rohaya, Hussin, Masnida

“…We have evaluated the FaaSBid model and the proposed algorithms and pricing model by comparing with a number of existing models and algorithms using real-world datasets. …”
Get full text
Get full text
Get full text

An efficient computation technique for cryptosystems based on Lucas functions by Md Ali, Zulkarnain, Othman, Mohamed, Md. Said, Mohamad Rushdan, Sulaiman, Md. Nasir

“…We have found that the binary sequence used in a new algorithm is shorter than a special sequence used in an existing algorithm. …”
Get full text
Get full text

Comparison between Genetic Algorithm and Prey-Predator Algorithm. by Ong, Hong Choon

“…We introduce a new metaheuristic algorithm inspired by prey-predator interaction of animals. …”
Get full text

Enhancing speed performance of the cryptographic algorithm based on the lucas sequence by M. Abulkhirat, Esam

“…Reducing the calculation time of the algorithm, in sequential and parallel platforms, using the doubling-rule technique combined with a new scheme led to a strong improvement of the LUC algorithm speed. …”
Get full text
Get full text

New heuristic function in ant colony system for the travelling salesman problem by Alobaedy, Mustafa Muwafak, Ku-Mahamud, Ku Ruhana

“…However, one part of the algorithm, called heuristic function, is not updated at any time throughout the process to reflect the new information discovered by the ants.This paper proposes an Enhanced Ant Colony System algorithm for solving the Travelling Salesman Problem.The enhanced algorithm is able to generate shorter tours within reasonable times by using accumulated values from pheromones and heuristics.The proposed enhanced ACS algorithm integrates a new heuristic function that can reflect the new information discovered by the ants. …”
Get full text
Get full text
Get full text

New heuristic function in ant colony system for job scheduling in grid computing by Ku-Mahamud, Ku Ruhana, Alobaedy, Mustafa Muwafak

“…Job scheduling problem classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Ant colony system algorithm is a meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This paper focuses on enhancing the heuristic function where information about recent ants’ discoveries will be taken into account.Experiments were conducted using a simulator with dynamic environment features to mimic the grid environment.Results show that the proposed enhanced algorithm produce better output in term of utilization and make span.…”
Get full text
Get full text

Designing New Block Cipher Based On Genetic Algorithm Approach by Nur Hafiza Binti Zakaria, Ramlan Mahmod, Nur Izura Udzir, Zuriati Ahmad Zukarnain, Suriyani Ariffin

A cylindrical coordinate system with dynamic permutation table for blowfish algorithm by Al-Abiachi, Ashwak M., Mahmod, Ramlan, Ahmad, Faudziah

“…The Blowfish Algorithm (BA) is a symmetric block cipher that iterates simple encryption and decryption functions by using Feistel networks.BA keys vary from 32-448 bits to ensure a high level of security.However, the BA requires a high memory percentage and it has a problem regarding randomness of output with text and image files having large strings of identical bytes.One solution to the seissues is to design a new Cryptography algorithm based on the BA that incorporates an F-function into a Cylindrical Coordinate System (CCS).The resulting F-function is known as a CCS with a Dynamic Permutation Table (DPT) or CCSDPT whereas the new algorithm is called the New BA (NBA).The objectives of the CCSDPT are to reduce memory requirements, enhance the randomness of the output and increase resistance to attacks through byte relocation and transformation in the right cylinder.NBA is evaluated by investigates the output of the algorithm by using statistical tests from the National Institute of Standard and Technology (NIST) with five types of data and compared with the BA.The findings of the NIST tests show that the NBA is suitable for any data stream, even those with long strings of identical bytes. …”
Get full text
Get full text
Get full text

Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid by Ku-Mahamud, Ku Ruhana, Ramli, Razamin, Yusof, Yuhanis, Mohamed Din, Aniza, Mahmuddin, Massudi

“…Job scheduling problem is classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Among different optimization algorithms for job scheduling, ant colony system algorithm is a popular meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This research focuses on a new heuristic function where information about recent ants’ discoveries has been considered.The new heuristic function has been integrated into the classical ant colony system algorithm.Furthermore, the enhanced algorithm has been implemented to solve the travelling salesman problem as well as in scheduling of jobs in computational grid.A simulator with dynamic environment feature to mimic real life application has been development to validate the proposed enhanced ant colony system algorithm. …”
Get full text
Get full text