Search Results - (( simulation permutation based algorithm ) OR ( java _ visualization algorithm ))

Search alternatives:

Refine Results
  1. 1
    A performance analysis of association rule mining algorithms

    A performance analysis of association rule mining algorithms by Fageeri, S.O., Ahmad, R., Alhussian, H.

    Published 2016
    “…The results of the CPU profiler of Java VisualVM showed that Binary-Based algorithm performs better than Eclat algorithm in-terms of both execution times and memory usage. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  2. 2
    Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem

    Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem by N. A., Isa, S. A., Bareduan, A. S., Zainudin, M., Marsudi

    Published 2021
    “…In this study, an experiment involving machines (m =4) and n-job (n = 6, 10, 15, 20) was simulated in Microsoft Excel Simple Programming to solve the permutation flowshop scheduling problem. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem

    Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem by Isa, N.A., Bareduan, S.A., Zainudin, A.S., Marsudi, M.

    Published 2021
    “…In this study, an experiment involving machines (m =4) and n-job (n = 6, 10, 15, 20) was simulated in Microsoft Excel Simple Programming to solve the permutation flowshop scheduling problem. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem

    Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem by Isa, N.A., Bareduan, S.A., Zainudin, A.S., Marsudi, M.

    Published 2021
    “…In this study, an experiment involving machines (m =4) and n-job (n = 6, 10, 15, 20) was simulated in Microsoft Excel Simple Programming to solve the permutation flowshop scheduling problem. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    Performance evaluation of real-time multiprocessor scheduling algorithms

    Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

    Published 2016
    “…We hyave used the CPU profiler of Oracle JavaTM VisualVM to monitor the execution of LRE-TL as well as USG algorithms. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  6. 6
    Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem

    Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem by Suhazri Amrin, Rahmad, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

    Published 2022
    “…Purpose – The purpose of the research is to solve Travelling Salesman Problem (TSP) using Simulated Kalman Filter (SKF) algorithm and single-solution SKF (ssSKF) algorithm based on numerical ordering technique. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  7. 7
    Development of improved bottleneck-based heuristic for re-entrant flow shop with dominant machine at M1 and M4

    Development of improved bottleneck-based heuristic for re-entrant flow shop with dominant machine at M1 and M4 by Mohd Fidzwan, Md Amin Hamzas, Ahmad Bareduan, Salleh, Liyana, Tajul, Mohd Sabri, Hussin, Zailani, Zainal Abidin, Hasnul, Hadi

    Published 2013
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Bitwise-based Routing Algorithms in Optical Multistage Interconnection Network

    Bitwise-based Routing Algorithms in Optical Multistage Interconnection Network by Abed, Farzaneh

    Published 2007
    “…To avoid crosstalk in OMINs many algorithms have been proposed by many researchers such as the Four Heuristic, Simulated Annealing, Genetic, Remove Last Passes and Zero Algorithms. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Flowshop scheduling using artificial bee colony (ABC) algorithm with varying onlooker bees approaches

    Flowshop scheduling using artificial bee colony (ABC) algorithm with varying onlooker bees approaches by Mohd Pauzi, Nur Fazlinda

    Published 2015
    “…At high iterations of 204 and above, method 3+0+0 dominates the best performance. Based on this finding, the selection of the best method can be decided based on the iteration time available. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Simulated Annealing Based Strategy for Test Redundancy Reduction

    Simulated Annealing Based Strategy for Test Redundancy Reduction by Kamal Z., Zamli, Mohd Hafiz, Mohd Hassin, Al-Kazemi, Basem, Naseer, Atif

    Published 2014
    “…Unlike existing works which rely on the Greedy approaches, our work adopts the random sequence permutation and optimization algorithm based on Simulated Annealing with systematic merging technique. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  11. 11
    Visdom: Smart guide robot for visually impaired people

    Visdom: Smart guide robot for visually impaired people by Lee, Zhen Ting

    Published 2025
    “…An Android mobile application, developed using Java and the java.net.Socket library, provides an intuitive and accessible user interface for seamless interaction with the robot. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  12. 12
    A Simulated Annealing-Based Hyper-Heuristic For The Flexible Job Shop Scheduling Problem

    A Simulated Annealing-Based Hyper-Heuristic For The Flexible Job Shop Scheduling Problem by Kelvin, Lim Ching Wei

    Published 2023
    “…Positive outcomes on the application of simulated annealing-based hyper-heuristic (SA-HH) in addressing similar scheduling problem has been reported in the literature. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Zero Algorithms for Avoiding Crosstalk in Optical Multistage Interconnection Network

    Zero Algorithms for Avoiding Crosstalk in Optical Multistage Interconnection Network by Ali Al-Shabi, Mohammed Abdulhameed

    Published 2005
    “…This routing problem is an NP-hard problem. Many heuristic algorithms have been proposed and designed to perform the routing such as the sequential algorithm, the sequential down algorithm, the degree-ascending algorithm, the degree-descending algorithm, the Simulated Annealing algorithm and the Ant Colony algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Cutpoint determination methods in competing risks subdistribution model

    Cutpoint determination methods in competing risks subdistribution model by Noor Akma Ibrahim, Abdul Kudus, Isa Daud, Mohd. Rizam Abu Bakar

    Published 2009
    “…Simulation results show that the deviance method has the desired properties. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Development of an Image Encryption Algorithm using Latin Square Matrix and Logistics Map

    Development of an Image Encryption Algorithm using Latin Square Matrix and Logistics Map by Emmanuel Oluwatobi Asani, Godsfavour Biety-Nwanju, Abidemi Emmanuel Adeniyi, Salil Bharany, Ashraf Osman Ibrahim Elsayed, Anas W. Abulfaraj, Wamda Nagmeldin

    Published 2023
    “…The hybrid technique was simulated on image data and evaluated to gauge its performance. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Cutpoint determination methods in competing risks subdistribution model

    Cutpoint determination methods in competing risks subdistribution model by Ibrahim, Noor Akma, Kudus, Abdul, Daud, Isa, Abu Bakar, Mohd Rizam

    Published 2009
    “…Simulation results show that the deviance method has the desired properties. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Web-based RIG performance reporting system using interactive visualization techniques / Amir Hambaly Nasaruddin

    Web-based RIG performance reporting system using interactive visualization techniques / Amir Hambaly Nasaruddin by Nasaruddin, Amir Hambaly

    Published 2019
    “…D3.js is used as a technology to visualize the result in interactive form or dynamic visualization which is a JavaScript library and Python is a language to program the system. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Performance evaluation of m3 bottleneck based heuristic for M1M2M3 flow shop

    Performance evaluation of m3 bottleneck based heuristic for M1M2M3 flow shop by Md Amin Hamzas, Mohd Fidzwan, Ahmad Bareduan, Salleh, Hussin, M.S., Hasnul, M.J.

    Published 2012
    “…Due to the re-entrant and permutation nature of the process routing, the actual bottlenecks were identified as M3 and it utilized makespan algorithms to identify bottleneck categories. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Enhanced bibliographic data retrieval and visualization using query optimization and spectral centrality measure

    Enhanced bibliographic data retrieval and visualization using query optimization and spectral centrality measure by Ramasamy, Chitra, Zolkepli, Maslina

    Published 2019
    “…This study proposing an enhance bibliographic data retrieval and visualization using hybrid clustering method consists of K-harmonic mean (KHM) and Spectral Algorithm and eigenvector centrality measure. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Mathematical simulation for 3-dimensional temperature visualization on open source-based grid computing platform

    Mathematical simulation for 3-dimensional temperature visualization on open source-based grid computing platform by Alias, Norma, Satam, Noriza, Abd. Ghaffar, Zarith Safiza, Darwis, Roziha, Hamzah, Norhafiza, Islam, Md. Rajibul

    Published 2009
    “…The development of this architecture is based on several programming language as it involves algorithm implementation on C, parallelization using Parallel Virtual Machine (PVM) and Java for web services development. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:

Search Tools: