Search Results - (( simulation optimization method algorithm ) OR ( problem implementation tree algorithm ))

Search alternatives:

Refine Results
  1. 1
    Optimizing tree planting areas through integer programming and improved genetic algorithm

    Optimizing tree planting areas through integer programming and improved genetic algorithm by Md Badarudin, Ismadi

    Published 2012
    “…The simulation of planting lining design relative to possible solutions of dividing an area to blocks (block division) and selecting planting lining direction towards optimizing tree planting areas is a complex problem. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    A safe overtaking control scheme for autonomous vehicles using rapid-exploration random tree

    A safe overtaking control scheme for autonomous vehicles using rapid-exploration random tree by Yincong Ma, Kit Guan Lim, Min Keng Tan, Helen Sin Ee Chuo, Lorita Angeline, Kenneth Tze Kin Teo

    Published 2022
    “…Firstly, the kinematics and dynamic model of the vehicle are implemented. Secondly, the RRT algorithm and the A-star algorithm are expounded, and the idea of the A-star algorithm is applied to the RRT algorithm for improvement. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceedings
    Save to List
    Saved in:
  3. 3
    Attribute related methods for improvement of ID3 Algorithm in classification of data: A review

    Attribute related methods for improvement of ID3 Algorithm in classification of data: A review by Nur Farahaina, Idris, Mohd Arfian, Ismail

    Published 2020
    “…There are several learning algorithms to implement the decision tree but the most commonly-used is ID3 algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    A quantum algorithm for minimal spanning tree

    A quantum algorithm for minimal spanning tree by Aghaei, Mohammad Reza Soltan, Ahmad Zukarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

    Published 2008
    “…Classical algorithms involve searching over some space for finding the minimal spanning tree problem in a graph. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  5. 5
    Some greedy based algorithms for multi periods degree constrained minimum spanning tree problem

    Some greedy based algorithms for multi periods degree constrained minimum spanning tree problem by Wamiliana, Wamiliana, Elfaki, Faiz Ahmed Mohamed, Usman, Mustofa, Azram, Mohammad

    Published 2015
    “…We implemented our algorithms on 300 generated problems with vertex order ranging from 10 to 100, and compared them with those that were already in the literature. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Classification of breast cancer disease using bagging fuzzy-id3 algorithm based on fuzzydbd

    Classification of breast cancer disease using bagging fuzzy-id3 algorithm based on fuzzydbd by Nur Farahaina, Idris

    Published 2022
    “…The bagging method was then applied to the FID3-DBD algorithm to overcome overfitting problems and high variance in decision trees. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Optimization of turning parameters using genetic algorithm method

    Optimization of turning parameters using genetic algorithm method by Shah Izwandi, Mohd Zawawi

    Published 2008
    “…The simulation based on Genetic Algorithm are successful develop and the optimum parameters values are obtained from the simulation.…”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  8. 8
    Hybrid firefly and particle swarm optimization algorithm for multi-objective optimal power flow with distributed generation

    Hybrid firefly and particle swarm optimization algorithm for multi-objective optimal power flow with distributed generation by Khan, Abdullah

    Published 2022
    “…This thesis proposes and simulates the three novel optimization algorithms to handle DG allocation, different single-objective, and multi-objective OPF problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Optimized routing algorithm for mobile multicast source in Wireless Mesh Networks

    Optimized routing algorithm for mobile multicast source in Wireless Mesh Networks by Sanni, Mistura Laide, Hassan Abdalla Hashim, Aisha, Hassan, Wan Haslina, Anwar, Farhat, Ahmed, Gharib Subhi Mahmoud

    Published 2015
    “…Simulation results show that the proposed algorithm converges and outperforms a source based tree algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  10. 10
    A discrete simulated kalman filter optimizer for combinatorial optimization problems

    A discrete simulated kalman filter optimizer for combinatorial optimization problems by Suhazri Amrin, Rahmad

    Published 2022
    “…An example of a numerical algorithm is the simulated Kalman filter (SKF). Various method has been introduced as an extension of a numerical algorithm to adapt it to a discrete search space. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan

    Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan by Misnan, Azizi

    Published 1997
    “…This bound enables us to prune the search tree efficiently. The algorithm will be implemented and tested in this project using C language. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Route optimization using shortest path method / Muhamad Faisal Amin Shakri

    Route optimization using shortest path method / Muhamad Faisal Amin Shakri by Shakri, Muhamad Faisal Amin

    Published 2025
    “…Therefore, the effectiveness of route planning is very essential. The method to study route optimization is called shortest path method. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Improved particle swarm optimization by fast annealing algorithm

    Improved particle swarm optimization by fast annealing algorithm by Bashath, Samar, Ismail, Amelia Ritahani

    Published 2019
    “…We also apply the algorithm in clustering problem, and the results shows that the proposed method has better accuracy than the optimization methods.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  14. 14
    Asynchronous simulated kalman filter optimization algorithm

    Asynchronous simulated kalman filter optimization algorithm by Zuwairie, Ibrahim, Nor Azlina, Ab. Aziz, Nor Hidayati, Abd Aziz, Tasiransurini, Ab Rahman

    Published 2018
    “…Simulated Kalman filter (SKF) is an optimization algorithm which is inspired by Kalman filtering method. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    A hybrid algorithm for finding shortest path in network routing.

    A hybrid algorithm for finding shortest path in network routing. by Soltan Aghaei, Mohammad Reza, Ahmad Zulkarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

    Published 2009
    “…This wave gives an O( N ) steps quantum algorithm for identifying that record, where was used classical Dijkstra’s algorithm for finding shortest path problem in the graph of network and implement quantum search. …”
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Comparison of Gradient Boosting Decision Tree Algorithms for CPU Performance

    Comparison of Gradient Boosting Decision Tree Algorithms for CPU Performance by Haithm Haithm, ALSHARI, Abdulrazak Yahya, Saleh, Alper, ODABAŞ

    Published 2021
    “…Gradient Boosting Decision Trees (GBDT) algorithms have been proven to be among the best algorithms in machine learning. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Simulated Kalman Filter algorithms for solving optimization problems

    Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

    Published 2019
    “…In this research, two novel estimation-based metaheuristic optimization algorithms, named as Simulated Kalman Filter (SKF), and single-solution Simulated Kalman Filter (ssSKF) algorithms are introduced for global optimization problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Hyper-Heuristic Evolutionary Approach for Constructing Decision Tree Classifiers

    Hyper-Heuristic Evolutionary Approach for Constructing Decision Tree Classifiers by Kumar, Sunil, Ratnoo, Saroj, Vashishtha, Jyoti

    Published 2021
    “…Classification and Regression Tree (CART) algorithm is one of the renowned decision tree induction algorithms to address the classification as well as regression problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Optimization of milling parameters using ant colony optimization

    Optimization of milling parameters using ant colony optimization by Mohd Saupi, Mohd Sauki

    Published 2008
    “…The simulation based on ACO algorithm are successful develop and the optimization of parameters values is to maximize the production rate is obtain from the simulation.…”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  20. 20
    Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem

    Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem by Ismail, Zuhaimy, Nurhadi, Irhamah, Zainuddin, Zaitul Marlizawati

    Published 2008
    “…Genetic Algorithm as population-based methods are better identifying promising areas in the search space, while Tabu Search and Simulated Annealing as trajectory methods are better in exploring promising areas in search space. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:

Search Tools: