Search Results - (( ((optimal code) OR (optical code)) algorithm ) OR ( optimal graph algorithm ))

Search alternatives:

Refine Results
  1. 1
    Approximate methods for minimum vertex cover fail to provide optimal results on small graph instances: A review

    Approximate methods for minimum vertex cover fail to provide optimal results on small graph instances: A review by Fayaz, Muhammad, Arshad, Shakeel, Shah, Abdul Salam, Shah, Asadullah

    Published 2018
    “…The key contribution of this paper is the provision of small benchmark graphs on which the given approximation algorithms fail to provide optimal results. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article

    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article by Othman, Nor Shuhaida

    Published 2010
    “…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator

    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator by Othman, Nor Shuhaida

    Published 2010
    “…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  4. 4
    Test case minimization applying firefly algorithm

    Test case minimization applying firefly algorithm by Hashim, Nor Laily, Dawood, Yasir Salman

    Published 2018
    “…The proposed test case minimization method has the following steps: provide weight to the paths, calculate path coverage for each path, transform an immediate graph into an adjacency matrix, which later is used to apply firefly algorithm and generate optimal test cases. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    Software regression test case prioritization for object-oriented programs using genetic algorithm with reduced-fitness severity

    Software regression test case prioritization for object-oriented programs using genetic algorithm with reduced-fitness severity by Musa, Samaila, Md Sultan, Abu Bakar, Abd Ghani, Abdul Azim, Baharom, Salmi

    Published 2015
    “…This paper propose an optimized regression test case selection and prioritization for object-oriented software based on dependence graph model analysis of the source code and optimized the selected test case using Genetic Algorithm. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  6. 6
    Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter

    Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter by Azhar, Nur Huwaina

    Published 2019
    “…LACE algorithm is used to schedule and optimize Virtual Machine (VMs) allocation across the servers according to behaviour obtained from locust nature. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Regression test case selection & prioritization using dependence graph and genetic algorithm

    Regression test case selection & prioritization using dependence graph and genetic algorithm by Musa, Samaila, Md Sultan, Abu Bakar, Abd Ghani, Abdul Azim, Baharom, Salmi

    Published 2014
    “…The approach is based on optimization of selected test case from dependency analysis of the source codes. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    A NOVEL CONSTRUCTION OF VECTOR COMBINATORIAL (VC) CODE FAMILIES AND DETECTION SCHEME FOR SAC OCDMA SYSTEMS

    A NOVEL CONSTRUCTION OF VECTOR COMBINATORIAL (VC) CODE FAMILIES AND DETECTION SCHEME FOR SAC OCDMA SYSTEMS by AHMED MOHMED, HASSAN YOUSIF

    Published 2010
    “…There has been growing interests in using optical code division multiple access (OCDMA) systems for the next generation high-speed optical fiber networks. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    A genetic algorithm to minimise the maximum lateness on a single machine family scheduling problem

    A genetic algorithm to minimise the maximum lateness on a single machine family scheduling problem by Lee, Lai Soon, Nazif, Habibeh

    Published 2009
    “…All algorithms are coded in ANSI-C using Microsoft Visual C++ 6.0 as the compiler, and run on a Pentium 4, 2.0 GHz computer with 2.0 GB RAM. …”
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  10. 10
    Automatic Number Plate Recognition on android platform: With some Java code excerpts

    Automatic Number Plate Recognition on android platform: With some Java code excerpts by ., Abdul Mutholib, Gunawan, Teddy Surya, Kartiwi, Mira

    Published 2016
    “…The main challenges of implementing ANPR algorithm on mobile phone are how to produce a higher coding efficiency, lower computational complexity, and higher scalability. …”
    Get full text
    Get full text
    Get full text
    Book
    Save to List
    Saved in:
  11. 11
    Using genetic algorithms to optimise land use suitability

    Using genetic algorithms to optimise land use suitability by Pormanafi, Saeid

    Published 2012
    “…Second task is to determine the fitness function for the genetic algorithms. The third objective is to optimize the land use map using economic benefits. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    DeMI interface tool for profit estimation and waste conversion technology recommendations in enhancing municipal solid waste management

    DeMI interface tool for profit estimation and waste conversion technology recommendations in enhancing municipal solid waste management by Ali, R.A., Nik Ibrahim, N.N.L., Ghani, W.A.W.A.K., Sani, N.S., Lam, H.L.

    Published 2024
    “…Leveraging the accelerated branch-and-bound algorithm, the P-graph efficiently generates optimal structures capable of accommodating diverse complexities, thus ensuring adaptability in synthesising process configurations. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    An effective transmit packet coding with trust-based relay nodes in VANETs

    An effective transmit packet coding with trust-based relay nodes in VANETs by Hammood, Omar A., M. N. M., Kahar, Hammood, Waleed A., Hasan, Raed Abdulkareem, Mohammed, Mostafa Abdulghfoor, Yoob, Ayoob A., Sutikno, Tole

    Published 2020
    “…Here, the trust-based graph optimization is performed using Cuckoo search algorithm to select the secure relay nodes. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences

    Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences by Rajesvary Rajoo R., Salam R.A.

    Published 2024
    journal::journal article
    Save to List
    Saved in:
  15. 15
    Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan

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

    Published 1997
    “…Searching for possible abutment between the transistor pairs are modelled as a bipartite graph. A depth - first search algorithm is used to search for optimal chaining. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Optimizing boarding school schedule using graph colouring : case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri

    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
    Save to List
    Saved in:
  17. 17
    Optimizing boarding school schedule using graph coloring: case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri

    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
    Save to List
    Saved in:
  18. 18
    Graph theory approach for managing lecturers’ schedule using graph colouring method / Siti Nor Ba Basri, Nur Su’aidah Khozaid and Farhana Hazwani Ismail

    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
    “…By using graph theory, graph colouring techniques, and ILP validation, this work optimizes lecturers' timetable scheduling, resolving conflicts, omissions, limitations, and preferences for optimal educational scheduling and resource allocation. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  19. 19
    The Half-t adaptive error correction algorithm for SDH-based WDM optical networks

    The Half-t adaptive error correction algorithm for SDH-based WDM optical networks by Cheah, Cheng Lai, Abdullah, Mohamad Khazani

    Published 2007
    “…This paper proposes an adaptive forward error correction (FEC) algorithm, referred to as the Half-t algorithm for synchronous digital hierarchy (SDH) based wavelength division multiplexing (WDM) optical networks. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  20. 20
    African Buffalo Optimization (ABO): A New Metaheuristic Algorithm

    African Buffalo Optimization (ABO): A New Metaheuristic Algorithm by Odili, Julius Beneoluchi, M. N. M., Kahar

    Published 2015
    “…The African Buffalo Optimization (A.B.0) algorithm simulates the African buffalos' behaviour by encapsulation in a mathematical model; which solves a number of discrete optimization problems using graph-based route planning, job scheduling and it extends Swarm Intelligence paradigms. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: