Search Results - (( developing improving time algorithm ) OR ( java optimization method algorithm ))

Refine Results
  1. 1
  2. 2

    An ensemble learning method for spam email detection system based on metaheuristic algorithms by Behjat, Amir Rajabi

    Published 2015
    “…Feature subset selection and classifier ensemble learning are familiar techniques with high ability to optimize above problems. Recently, various techniques based on different algorithms have been developed. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Smart student timetable planner by Wong, Xin Tong

    Published 2025
    “…The system is implemented using Node.js with Express for server-side development, HTML, CSS, and JavaScript for the frontend, and Socket.IO for real-time collaboration. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  4. 4

    Route Optimization System by Zulkifli, Abdul Hayy

    Published 2005
    “…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
    Get full text
    Get full text
    Final Year Project
  5. 5

    Fuzzy modeling using Bat Algorithm optimization for classification by Noor Amidah, Ahmad Sultan

    Published 2018
    “…In order to solve it, Bat Algorithm method is implement in to optimization method in fuzzy modeling for classification. …”
    Get full text
    Get full text
    Get full text
    Undergraduates Project Papers
  6. 6

    Optimal route checking using genetic algorithm for UiTM's bus services / Tengku Salman Fathi Tengku Jaafar by Tengku Jaafar, Tengku Salman Fathi

    Published 2006
    “…This research study with the development of the Optimal Route Checking Using Genetic Algorithm system should solve this scenario. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Optimize class time tabling by using genetic algorithm technique in UTHM by Ahmad, Izah Rafidah

    Published 2019
    “…This research used genetic algorithm (GA) that was applied to java programming languages with a goal of reducing conflict and optimizing the fitness. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  8. 8
  9. 9

    Features selection for intrusion detection system using hybridize PSO-SVM by Tabaan, Alaa Abdulrahman

    Published 2016
    “…Features selection process can be considered a problem of global combinatorial optimization in machine learning. Genetic algorithm GA had been adopted to perform features selection method; however, this method could not deliver an acceptable detection rate, lower accuracy, and higher false alarm rates. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Comparison of performances of Jaya Algorithm and Cuckoo Search algorithm using benchmark functions by Ahmed, Mashuk, Nasser, Abdullah B., Kamal Z., Zamli, Heripracoyo, Sulistyo

    Published 2022
    “…Metaheuristic algorithms have been used successfully for solving different optimization problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    Implementation of New Improved Round Robin (NIRR) CPU scheduling algorithm using discrete event simulation by Chang, Jan Voon

    Published 2015
    “…The proposed NIRR algorithm has shown improvement over the traditional Round Robin algorithm. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Implementation of New Improved Round Robin (NIRR) CPU scheduling algorithm using discrete event simulation by Chang, Jan Voon, Ahmad, Idawaty

    Published 2016
    “…The proposed NIRR algorithm has shown improvement over the traditional Round Robin algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13
  14. 14

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

    Published 2007
    “…The results of this study show that Bitwise Improved Zero algorithms reduce the execution time nearly seven times. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Web-based expert system for material selection of natural fiber- reinforced polymer composites by Ahmed Ali, Basheer Ahmed

    Published 2015
    “…An inappropriate selection of materials for engineering component would result in entire product failure which ultimately has a negative impact on the society. Several algorithms, methods and spreadsheets are being proposed by various researchers in this field to improve materials selection. …”
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17

    Improving utility accrual scheduling algorithm for adaptive real-time system by Ahmad, Idawaty, Othman, Mohamed, Ahmad Zukarnain, Zuriati, Othman, Muhammad Fauzan

    Published 2008
    “…Both of these algorithms are developed for adaptive real-time system environment where untoward effects such as deadline misses and overloads are tolerable. …”
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    Kernel and multi-class classifiers for multi-floor wlan localisation by Abd Rahman, Mohd Amiruddin

    Published 2016
    “…The improved accuracy is due to better performance of proposed floor and horizontal localisation algorithm while the computational time is reduced due to introduction of AP selection algorithm.…”
    Get full text
    Get full text
    Thesis
  19. 19

    Statistical selection algorithm for peer-to-peer system by Othman, Mohamed, Kweh, Yeah Lun

    Published 2008
    “…This improved algorithm is developed based on the simulation of the real multicast environment. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    An Improved-Time Polynomial-Space Exact Algorithm For TSP In Degree-5 Graphs by Md Yunos, Norhazwani, Shurbevski, Aleksandar, Nagamochi, Hiroshi

    Published 2017
    “…Following a recent trend of research which focuses on developing algorithms for special types of TSP instances, namely graphs of limited degree, in an attempt to reduce a part of the time and space complexity, we present a polynomial-space branching algorithm for the TSP in an n-vertex graph with degree at most 5, and show that it has a running time of O∗(2.3500n), which improves the previous best known time bound of O∗(2.4723n) given by the authors (the 12th International Symposium on Operations Research and Its Application (ISORA 2015), pp.45–58, 2015). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article