Search Results - (( developing triad method algorithm ) OR ( java implementation graph algorithm ))

Search alternatives:

  • Showing 1 - 6 results of 6
Refine Results
  1. 1
    Developing triad design algorithms based on compatible factorization

    Developing triad design algorithms based on compatible factorization by Ibrahim, Haslinda, Omar, Zurni, Abdul Rahim, Rahela

    Published 2011
    “…These processes have helped us develop algorithm for triad design, the objective of this study.A new technique for triad design algorithm, known as Interval Generation Method was employed to construct TD(6n + 1) and TD(6n + 5).This method depends on analyzing the pattern of triples in the design to build starters.We begin by producing starters from Interval Generation Method as the initial block to begin with.Then the algorithm begins by cycling modular v from the initial block and finishes when the process approaches the initial block.The algorithms for TD(6n+1) and TD(6n+5) are presented in Chapter 4 and 5, respectively.As the entire study depends mainly on TD(v) algorithms, new and remarkable theorems and lemmas for TD(v) development are presented and proved.…”
    Get full text
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  2. 2
    Generalized Triad Design Algorithms

    Generalized Triad Design Algorithms by Saa, Tareq Mohammad Abu

    Published 2012
    “…Previous studies on TD(v) reported its existence when v≡1 or 5 (mod 6) and TD(7) was developed by using a brute-force method. In this study, generalized and new algorithms for developing TD(v) for any v = 6n + 1 or v = 6n + 5 were developed. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Developing an algorithm for triad design

    Developing an algorithm for triad design by Abu Saa, Tareq M., Ibrahim, Haslinda, Kalmoun, El Mostafa

    Published 2012
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    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
    “…In the benchmark paper, the result of implementation of LACE algorithm in 400, 600, 800 and 1000 servers were plotted at different graphs. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Priority and dynamic quantum time algorithms for central processing unit scheduling

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

    Published 2018
    “…The proposed algorithms (Priority Dynamic Quantum Time and Multi Priority Dynamic Quantum Time Algorithms) are implemented using JAVA programming language and validated using Key Performance Indicators equations. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs

    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

    Published 2019
    “…Therefore, this study proposed a cost-cognizant TCP approach for object-oriented software that uses path-based integration testing to identify the possible execution path extracted from the Java System Dependence Graph (JSDG) model of the source code using forward slicing technique. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: