Search Results - (( integer implementation success algorithm ) OR ( java implementation graph algorithm ))

  • Showing 1 - 12 results of 12
Refine Results
  1. 1

    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
  2. 2

    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
  3. 3

    Modification of particle swarm optimization algorithm for optimization of discrete values by Mohd Yassin, Ahmad Ihsan, Jusoh, Muhammad Huzaimy, Abdul Rahman, Farah Yasmin

    Published 2011
    “…These methods generally either represent the solution in binary form [5) or round off the continuous results into the closest integer [6-8). Both methods have been successfully implemented; however they either are computationally expensive for complex, multi-valued problems, or slow to converge due to rounding of the continuous variable. …”
    Get full text
    Get full text
    Research Reports
  4. 4

    Problem restructuring in interger programming for reduct searching by Ungku Chulan, Ungku Azmi Iskandar

    Published 2003
    “…Standard Integer Programming / Decision Related Integer Programming (SIP/DRIP) is a reduct searching system that finds the reducts in an information system. …”
    Get full text
    Get full text
    Thesis
  5. 5

    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
  6. 6
  7. 7

    Propositional satisfiability method in rough classification modeling for data mining by Abu Bakar, Azuraliza

    Published 2002
    “…Two models, Standard Integer Programming (SIP) and Decision Related Integer Programming (DRIP) to represent the minimal reduct computation problem were proposed. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Wild goats optimization approach for capacitor placement problem by Hamid Teimourzadeh, Behnam Mohammadi-Ivatloo, Ali Farzamnia

    Published 2019
    “…In this paper, WGA is successfully implemented to the CP problem with the objective of total loss reduction. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    A study on the significance of backlash width values to the performance of the MIQP-based design of MPC by H., Zabiri, Y., Samyudia

    Published 2005
    “…Simulation results via an industrial Fluidized Catalytic Cracking Unit (FCCU) case study are presented to show the significance of precise estimation of the backlash width in ensuring successful implementation of the MIQP-based design of MPC.…”
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10

    WIMAX TESTBED by KOH , MINGHAO

    Published 2008
    “…At these SNRs, the receiver side of the testbed is successful in performing the required synchronization and obtaining the same data sent. …”
    Get full text
    Get full text
    Final Year Project
  11. 11
  12. 12

    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