Search Results - (( using function new algorithm ) OR ( basic selection ((method algorithm) OR (path 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.

Scheduling of batch process plant / Abdul Aziz Abu Bakar by Abu Bakar, Abdul Aziz

“…This research work is devoted to software development of scheduling and control algorithm of batch process plant using shortest path method developed by Dijkstra and K* shortest path method developed by Jin Y. …”
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

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

“…The task is to extend the Cox proportional hazard model by using the new reproducing kernel obtained and apply the kernel method to randomly selected survival data sets. …”
Get full text
Get full text
Get full text

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

A Survey Of Supervised Machine Learning In Wireless Sensor Network: A Power Management Perspective by Ul haq, Riaz, Norrozila, Sulaiman, Muhammad, Alam

“…This survey paper is focused on the discussion of best optimal path routing algorithms in wireless sensor networks by using supervised machine learning approaches. …”
Get full text
Get full text

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

“…The basic component of the algorithm consists of several clans and each clan searches for the best place (or best solution) based on the position of their leader. …”
Get full text
Get full text

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

“…The accuracy for rules and classification resulted from the TIP method are compared with other methods such as Standard Integer Programming (SIP) and Decision Related Integer Programming (DRIP) from Rough Set, Genetic Algorithm (GA), Johnson reducer, HoltelR method, Multiple Regression (MR), Neural Network (NN), Induction of Decision Tree Algorithm (ID3) and Base Learning Algorithm (C4.5); all other classifiers that are mostly used in the classification tasks. …”
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

MOTION TARGET TRACKING OF MOBILE ROBOTS by NOOR RASHID, NOOR AIMAN

“…The main hardware and has been tested with basic programs based on the algorithms of the said methods. …”
Get full text
Get full text

Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment by Nurul Atikah Janis

“…Jump Point Search is one of the path finding algorithm with huge advantage of maintaining zero memory overhead as no preprocessing process involved. …”
Get full text
Get full text
Get full text

Network analysis for GPS UTMnav system: preliminary stage by A. Majid, Siti Nuruljannah, Musa, Tajul Ariffin, Setan, Halim, Musliman, Ivin Amri

“…Each algorithm was reviewed and a simulation test was conducted to evaluate the selected algorithms. …”
Get full text
Get full text
Get full text

IMPLEMENTATION OF BEHAVIOUR BASED NAVIGATION IN A PHYSICALLY CONFINED SITE by ABDUL RAZAK, NUSRAH

“…Selected basic behaviour-based algorithms such as wallfollower, obstacle avoidance, escape route and target detection are to be combined and its efficiency is measured. …”
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

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

Incremental learning for large-scale stream data and its application to cybersecurity by Ali, Siti Hajar Aminah

“…In Chapter 2, we propose a new algorithm based on incremental Radial Basis Function Network (RBFN) to accelerate the learning in stream data. …”
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

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

“…Next, the Dynamic Demand Replacement Algorithm (DDRA) algorithm is used to place in-demand functions near the edge nodes periodically, while the proposed task scheduling algorithm - Maximum Revenue Bid (MRB) is used to give priority to tasks to maximise revenue near the edge. …”
Get full text
Get full text
Get full text

VHDL modeling of optimum measurement selection by using genetic algorithm by Ullah, Mohammad Habib, Hasan, Muhammad Asfarul, Uddin, Md. Jasim, Priantoro, Akhmad Unggul

Get full text
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