Search Results - (( developing greedy method algorithm ) OR ( java adaptation optimization algorithm ))

Search alternatives:

Refine Results
  1. 1
    Parallel distributed genetic algorithm development based on microcontrollers framework

    Parallel distributed genetic algorithm development based on microcontrollers framework by Krishnan P.S., Kiong T.S., Koh J.

    Published 2023
    Conference paper
    Save to List
    Saved in:
  2. 2
    Routing problem in rectangular mesh network using Dijkstra’s based Greedy method

    Routing problem in rectangular mesh network using Dijkstra’s based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2018
    “…This paper presents a complete routing algorithm which can further refine the solution by using Dijkstra’s based greedy method. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  3. 3
    Routing problem in rectangular mesh network using shortest path based Greedy method

    Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2019
    “…This paper presents a complete routing algorithm which can further refine the solution by using Dijkstra's based greedy method. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  4. 4
    Multi-base number representation in application to scalar multiplication and pairing computation

    Multi-base number representation in application to scalar multiplication and pairing computation by Mohammed Ismail, Abdelwahed

    Published 2011
    “…In this work, an extension of Greedy algorithm called xGreedy, is proposed. It finds the best approximated powers of each base to be used to convert large integers to new addition chains. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Routing problem in rectangular mesh network using shortest path based Greedy method

    Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2019
    “…This paper presents a complete routing algorithm which can further refine the solution by using Dijkstra's based greedy method. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  6. 6
    Information Theoretic-based Feature Selection for Machine Learning

    Information Theoretic-based Feature Selection for Machine Learning by Muhammad Aliyu, Sulaiman

    Published 2018
    “…Besides, this thesis developed a hybrid filter method to enhance the performance of the IFS. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Developing a college room allocation system using heuristic algorithm / Raziha Bidin

    Developing a college room allocation system using heuristic algorithm / Raziha Bidin by Bidin, Raziha

    Published 2010
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem

    Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem by Fayaz, Muhammad, Arshad,, Shakeel, Shah,, Abdul Salam, Shah, Asadullah

    Published 2018
    “…Material and methods: To test the proposed technique, selected approximation algorithms have been developed to small graph instances. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Optimizing kindergarten schedule using : graph coloring / Nur Nabilah Salleh Muner

    Optimizing kindergarten schedule using : graph coloring / Nur Nabilah Salleh Muner by Salleh Muner, Nur Nabilah

    Published 2019
    “…The greedy algorithm was used to color the graph and it was supported by the C++ program. …”
    Get full text
    Get full text
    Research Reports
    Save to List
    Saved in:
  10. 10
    Influence maximisation towards target users and minimal diffusion of information based on information needs

    Influence maximisation towards target users and minimal diffusion of information based on information needs by Temitope, Olanrewaju Abdus-Samad

    Published 2020
    “…IDTU was developed on greedy approach by using graph sketches to improve the selection of influencers that maximize influence spread to a set of target users. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Enhancement of Ant System Algorithm for Course Timetabling Problem

    Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

    Published 2009
    “…This research starts with developing an algorithm based on original concept of Ant System Algorithm. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Integration Of Travel Time Zone For Optimal Siting Of Emergency Facilities

    Integration Of Travel Time Zone For Optimal Siting Of Emergency Facilities by Indriasari, Vini

    Published 2008
    “…Fire stations in Jakarta Selatan were chosen for simulation. Two algorithms, Greedy Adding (Add) and Greedy Adding with Travel Time Evaluation (GAT), were applied to solve the optimization problem of the MSAP. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Robust variable selection methods for large- scale data in the presence of multicollinearity, autocorrelated errors and outliers

    Robust variable selection methods for large- scale data in the presence of multicollinearity, autocorrelated errors and outliers by Uraibi, Hassan S.

    Published 2016
    “…Hence, Robust-LARS (RLARS-RFCH) based on √ consistent multivariate (RFCH) correlation matrix is developed. The proposed method is computationally efficient and its performance outperformed the RLARS-Winsor The algorithm of all possible subsets is greedy and it is inefficient and unstable in the presence of autocorrelated errors and outliers. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Using artificial intelligence search in solving the camera placement problem

    Using artificial intelligence search in solving the camera placement problem by Altahir, A.A., Asirvadam, V.S., Hamid, N.H.B., Sebastian, P.

    Published 2022
    “…Due to the impact of optimal camera placement on the efficiency and the cost of surveillance systems as well as the rapid development in sensor technologies and the pressing security needs, the last two decades witnessed an increasing interest in developing and introducing efficient methods for solving what is known as the camera placement problem. …”
    Get full text
    Get full text
    Book
    Save to List
    Saved in:
  15. 15
    Modeling of static and dynamic components of bio-nanorobotic systems

    Modeling of static and dynamic components of bio-nanorobotic systems by Gavgani, Hamidreza Khataee

    Published 2012
    “…In addition, a graph algorithm based on greedy methods is employed to compute a new set of optimal weighted electronic properties of the fullerenes via computing their Minimum Weight Spanning Trees (MWSTs). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    UiTM Transportation Unit bus trip scheduling system / Noorzawanah Ab Rahim

    UiTM Transportation Unit bus trip scheduling system / Noorzawanah Ab Rahim by Ab Rahim, Noorzawanah

    Published 2009
    “…The proposed heuristic algorithm is based on the simple greedy search, that guide the search efficiently and able to find good solutions. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Development of Guided Artificial Bee Colony (GABC) Heuristic for Permutation Flowshop Scheduling Problem (PFSP)

    Development of Guided Artificial Bee Colony (GABC) Heuristic for Permutation Flowshop Scheduling Problem (PFSP) by Sidek, Noor Azizah, Bareduan, Salleh Ahmad, Nawawi, Azli, Jia Yee, Ten

    Published 2024
    “…To find high-quality results with a faster convergence rate, this study developed a strategy to increase the convergence speed of ABC. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    A phonetically rich and balanced lexical corpus using zipfian distribution for an under resourced language / Aminath Farshana

    A phonetically rich and balanced lexical corpus using zipfian distribution for an under resourced language / Aminath Farshana by Aminath , Farshana

    Published 2018
    “…The performance of the proposed method was also evaluated by comparing the results with an existing benchmark method (greedy algorithm). …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Anfis Modelling On Diabetic Ketoacidosis For Unrestricted Food Intake Conditions

    Anfis Modelling On Diabetic Ketoacidosis For Unrestricted Food Intake Conditions by Saraswati, Galuh Wilujeng

    Published 2017
    “…The project has also implemented the optimization process onto the proposed ANFIS model through the hybrid of Genetic Algorithm on the fuzzy membership function of the ANFIS model. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Bayesian random forests for high-dimensional classification and regression with complete and incomplete microarray data

    Bayesian random forests for high-dimensional classification and regression with complete and incomplete microarray data by Oyebayo, Olaniran Ridwan

    Published 2018
    “…The new procedure called Bayesian Random Forest (BRF) focuses on modification of terminal node parameter estimation and selection of random subsets for splitting. BRF algorithm combines the strengths of random subset and greedy selection procedures in creating new maximal ordered variable relevance weights. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: