Search Results - (( problem implementation graph algorithm ) OR ( parameter optimization based algorithm ))

Refine Results
  1. 1

    Power system network splitting and load frequency control optimization using ABC based algorithms / Kanendra Naidu a/l Vijyakumar by Vijyakumar, Kanendra Naidu

    Published 2015
    “…This research presents a modified optimization program for the system splitting problem in large scale power system based on Artificial Bee Colony algorithm and graph theory. …”
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3

    Attack path selection optimization with adaptive genetic algorithms by Abd Rahman, A.S., Zakaria, M.N., Masrom, S.

    Published 2016
    “…We describe our approach for implementing an optimized security assessment using Genetic Algorithm (GA). …”
    Get full text
    Get full text
    Article
  4. 4

    Attack path selection optimization with adaptive genetic algorithms by Abd Rahman, A.S., Zakaria, M.N., Masrom, S.

    Published 2016
    “…We describe our approach for implementing an optimized security assessment using Genetic Algorithm (GA). …”
    Get full text
    Get full text
    Article
  5. 5

    An Edge-Wise Linear Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs by Qureshi, M.A., Hassan, M.F., Safdar, S., Akbar, R., Sammi, R.

    Published 2010
    “…The main advantage of the algorithms is its simplicity and it does not need complex data structures for implementations.…”
    Get full text
    Get full text
    Conference or Workshop Item
  6. 6

    Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan by Misnan, Azizi

    Published 1997
    “…This project implement a algorithm for the optimal transistor chaining problem in CMOS functional cell layout based on Uehara and vanCleemput's layout style [1] which assumed that the height of each logic module layout is constant and performed the optimisation by decomposing the graph module into a minimum number of sub graph having a dual Euler (d-Euler) trail.. …”
    Get full text
    Get full text
    Thesis
  7. 7

    An enumerative algorithm for the maximum clique problem by Mustafa, Mamat, Suyudi, M., Sukono, ., Bon, A.T.

    Published 2019
    “…Partial enumerative algorithms are presented for maximum clique problems which are very easy to implement. …”
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8

    Optimizing boarding school schedule using graph colouring : case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri by Mohd Asri, Nur Farhana

    Published 2021
    “…The result has shown that the Greedy Algorithm has succeeded to produce the lowest minimal color compared to Graph Coloring Algorithm. …”
    Get full text
    Get full text
    Student Project
  9. 9

    Optimizing boarding school schedule using graph coloring: case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri by Mohd Asri, Nur Farhana

    Published 2022
    “…The result has shown that the Greedy Algorithm has succeeded to produce the lowest minimal color compared to Graph Coloring Algorithm. …”
    Get full text
    Get full text
    Research Reports
  10. 10

    A hybrid algorithm for finding shortest path in network routing. by Soltan Aghaei, Mohammad Reza, Ahmad Zulkarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

    Published 2009
    “…This wave gives an O( N ) steps quantum algorithm for identifying that record, where was used classical Dijkstra’s algorithm for finding shortest path problem in the graph of network and implement quantum search. …”
    Get full text
    Article
  11. 11

    Quantum Processing Framework And Hybrid Algorithms For Routing Problems by Soltan Aghaei, Mohammad Reza

    Published 2010
    “…Another quantum algorithm for a minimum weight spanning tree in the graph was also designed. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Comparison between specifications of linear regression and spatial-temporal autoregressive models in mass appraisal valuation for single storey residential property by Jahanshiri, Ebrahim

    Published 2013
    “…It was also found that the graph based neighbours would increase the chance of the spatial model to predict better. …”
    Get full text
    Get full text
    Thesis
  13. 13

    A quantum algorithm for minimal spanning tree by Aghaei, Mohammad Reza Soltan, Ahmad Zukarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

    Published 2008
    “…Quantum computing algorithms are considered for several problems in graph theory. …”
    Get full text
    Get full text
    Conference or Workshop Item
  14. 14

    Bipartite graph approach to course timetabling problems / Hafizah A Razak by A Razak, Hafizah

    Published 2009
    “…Future research also can be carried out on the timetabling problems implementing other approaches.…”
    Get full text
    Get full text
    Thesis
  15. 15
  16. 16
  17. 17

    Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

    Published 2009
    “…As the requirement of the Ant System Algorithm, the problem is modeled as a graph that can be used by the ant to deliver its pheromone. …”
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    Integrated optimal control and parameter estimation algorithms for discrete-time nonlinear stochastic dynamical systems by Kek, Sie Long

    Published 2011
    “…The main idea is the integration of optimal control and parameter estimation. In this work, a simplified model-based optimal control model with adjustable parameters is constructed. …”
    Get full text
    Get full text
    Thesis
  19. 19

    On Adopting Parameter Free Optimization Algorithms for Combinatorial Interaction Testing by Kamal Z., Zamli, Alsariera, Yazan A., Nasser, Abdullah B., Alsewari, Abdulrahman A.

    Published 2015
    “…In doing so, this paper reviews two existing parameter free optimization algorithms involving Teaching Learning Based Optimization (TLBO) and Fruitfly Optimization Algorithm (FOA) in an effort to promote their adoption for CIT.…”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Partial examination assignment approaches for solving examination timetabling problems by Mandal, Ashis Kumar

    Published 2016
    “…The entire process runs until all of the examinations are assigned successfully. We have implemented partial graph heuristic with hill climbing (PGH-HC) and partial graph heuristic with modified great deluge algorithm (PGH-mGD) into solving the examination timetabling. …”
    Get full text
    Get full text
    Thesis