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

Refine Results
  1. 1
  2. 2

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

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

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

    Published 2018
    “…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
    Thesis
  4. 4

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

    Published 2016
    “…Then, we apply the kernel method to the survival data. Finally, we propose an algorithm of minimization of the loss function in the general Cox model. …”
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

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

    Published 2019
    “…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
    Thesis
  6. 6

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

    Published 2005
    “…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
    Thesis
  7. 7

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

    Published 2022
    “…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
    Thesis
  8. 8

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

    Published 2016
    “…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
    Thesis
  9. 9

    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

    Published 2007
    “…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
    Monograph
  10. 10

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

    Published 2018
    “…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
    Thesis
  11. 11

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

    Published 2005
    “…Randomly select the m data set for conventional training algorithm. …”
    Get full text
    Get full text
    Thesis
  12. 12

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

    Published 2012
    “…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
    Conference or Workshop Item
  13. 13

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

    “…The use of metaheuristic algorithms to different problems becomes very common after the introduction of genetic algorithm in 1975. …”
    Get full text
    Monograph
  14. 14

    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

    Published 2026
    “…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
    Article
  15. 15

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

    Published 2008
    “…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
    Conference or Workshop Item
  16. 16

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

    Published 2003
    “…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
    Thesis
  17. 17
  18. 18

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

    Published 2012
    “…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
    Conference or Workshop Item
  19. 19

    Edge detection and contour segmentation for fruit classification in natural environment / Khairul Adilah Ahmad by Ahmad, Khairul Adilah

    Published 2018
    “…This learning algorithm represents an automatic generation of membership functions and rules from the data. …”
    Get full text
    Get full text
    Thesis
  20. 20

    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

    Published 2012
    “…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
    Monograph