Search Results - (( evolution optimization protocol algorithm ) OR ( program validation using algorithm ))

Refine Results
  1. 1

    Differential evolution optimization for constrained routing in Wireless Mesh Networks by Sanni, Mistura Laide, Hassan Abdalla Hashim, Aisha, Hassan, Wan Haslina, Ahmed, Gharib Subhi Mahmoud, Anwar, Farhat, Zakaria, Omar

    Published 2014
    “…However, this problem is NP-complete, hence, this paper proposes fast convergent Differential Evolution metaheuristic algorithm with bandwidth and delay constraints for minimum routing cost. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  2. 2

    Dealing with Routing Hole Problem in Multi-hop Hierarchical Routing Protocol in Wireless Sensor Network by Sama, Najm Us

    Published 2019
    “…The challenging issue of routing protocols is to reduce the communication overhead for data transmission by determining an optimal path. …”
    Get full text
    Get full text
    Thesis
  3. 3

    A secure trust aware ACO-Based WSN routing protocol for IoT by Sharmin, Afsah, Anwar, Farhat, Motakabber, S. M. A., Hassan Abdalla Hashim, Aisha

    Published 2022
    “…The performance of the proposed routing algorithm is demonstrated through MATLAB. Based on the proposed system, to find the secure and optimal path while aiming at providing trust in IoT environment, the average energy consumption is minimized by nearly 50% even as the number of nodes has increased, as compared with the conventional ACO algorithm, a current ant-based routing algorithm for IoT-communication, and a present routing protocol RPL for IoT.…”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Quality of service and energy efficient aware (QEEA) scheduling algorithm for long term evolution (LTE) network / Nurulanis Mohd Yusoff by Mohd Yusoff, Nurulanis

    Published 2017
    “…The results showed that the QEEA algorithm outperformed the other algorithms as it could achieve up to 18% of maximum throughput, 27% reduction in ECR, and 36% improvement in EE in terms of radius ranging from 200 m to 1000 m. …”
    Get full text
    Get full text
    Thesis
  5. 5

    A comparative study for parameter selection in online auctions by Gan, Kim Soon

    Published 2009
    “…Hence, this work attempts to improve an existing bidding strategy by taking into accounts the evolution of various model of generic algorithm in optimizing the parameter of the bidding strategies. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6
  7. 7
  8. 8
  9. 9

    System identification using Extended Kalman Filter by Alias, Ahmad Hafizi

    Published 2017
    “…In order to evaluate the performance of the EKF learning algorithm, the proposed algorithm validation were analyzed using model validation methods as a checker such as One Step Ahead (OSA) and correlation coefficient (R2). …”
    Get full text
    Get full text
    Student Project
  10. 10

    A multi-depot vehicle routing problem with stochastic road capacity and reduced two-stage stochastic integer linear programming models for rollout algorithm by Anuar, Wadi Khalid, Lee, Lai Soon, Seow, Hsin Vonn, Pickl, Stefan

    Published 2021
    “…Then an extension, MDVRPSRC-2S, is presented as an offline two-stage SILP model of the MDDVRPSRC. These models are validated using small simulated instances with CPLEX. …”
    Get full text
    Get full text
    Article
  11. 11
  12. 12

    Solving Sudoku puzzles in Binary Integer Linear Programming using Branch and Bound algorithm / Ahida Waliyyah Ahmad Fuad by Ahmad Fuad, Ahida Waliyyah

    Published 2024
    “…This study explores the application of a Binary Integer Linear Programming (BILP) model combined with the Branch and Bound (B&B) algorithm to solve Sudoku puzzles. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Augmentation of basic-line-search and quick-simplex-method algorithms to enhance linear programming computational performance by Nor Azlan, Nor Asmaa Alyaa

    Published 2021
    “…Whereas, the validation from the real-world of the two datasets showed that the new augmentation algorithm steadily producing lesser iteration number compared to the conventional Simplex, QSM and BLSA algorithms. …”
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14

    Optimizing Visual Surveillance Sensor Coverage Using Dynamic Programming by Altahir, A.A., Asirvadam, V.S., Hamid, N.H.B., Sebastian, P., Saad, N.B., Ibrahim, R.B., Dass, S.C.

    Published 2017
    “…To validate the proposed algorithm, we compared the outcomes of the dynamic programming algorithm with the existing benchmarking placement optimization techniques. …”
    Get full text
    Get full text
    Article
  15. 15

    Priority and dynamic quantum time algorithms for central processing unit scheduling by Mohammed, Maysoon A.

    Published 2018
    “…Central Processing Unit is scheduled using different types of scheduling algorithms. One of the most widely algorithm used in scheduling with sharing and batch operating systems is Round Robin. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Graph theory approach for managing lecturers’ schedule using graph colouring method / Siti Nor Ba Basri, Nur Su’aidah Khozaid and Farhana Hazwani Ismail by Basri, Siti Nor Ba, Khozaid, Nur Su’aidah, Ismail, Farhana Hazwani

    Published 2023
    “…This study seeks to optimize the scheduling process by employing a graph theory approach with graph colouring method, as well as results validation by Integer Linear Programming (ILP) based on the graph colouring outcome by using the Phyton programming software, to effectively assign time slots for courses and lecturers while managing the risk of clashes and omissions. …”
    Get full text
    Get full text
    Student Project
  17. 17

    Novice programmers’ emotion and competency assessments using machine learning on physiological data / Fatima Jannat by Fatima, Jannat

    Published 2022
    “…Hyper-parameter tuning has been used in all the algorithms using k-fold cross validation to have the best accuracy and to avoid the over-fitting issue. …”
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    Model structure selection for a discrete-time non-linear system using a genetic algorithm by Ahmad, R., Jamaluddin, H., Hussain, M. A.

    Published 2004
    “…The performance of the proposed algorithm is also compared to the model developed using the orthogonal least squares (OLS) algorithm. …”
    Get full text
    Get full text
    Article
  19. 19

    Model structure selection for a discrete-time non-linear system using a genetic algorithm by Ahmad, R., Jamaluddin, H., Hussain, M. A.

    Published 2004
    “…The performance of the proposed algorithm is also compared to the model developed using the orthogonal least squares (OLS) algorithm. …”
    Get full text
    Get full text
    Article
  20. 20

    Model structure selection for a discrete-time non-linear system using genetic algorithm by Ahmad, Robiah, Jamaluddin , Hishamuddin, Hussain, Mohd. Azlan

    Published 2004
    “…The performance of the proposed algorithm is also compared to the model developed using the orthogonal least squares (OLS) algorithm. …”
    Get full text
    Get full text
    Get full text
    Article