Search Results - binary ((((((path OR batch) OR buat) algorithm) OR (_ algorithm))) OR (based algorithm))

Search alternatives:

Refine Results
  1. 1

    Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system by Mohammad Ata, Karimeh Ibrahim, Che Soh, Azura, Ishak, Asnor Juraiza, Jaafar, Haslina

    Published 2021
    “…This solution depending on applying the optimization on an optimal path while the traditional ACO is optimizing the random path based on the greedy algorithm hence we get the most optimal path. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Path planning algorithm for a car like robot based on MILP method by Mohd Sadri, Mohd Pawzi

    Published 2013
    “…This project is presents an algorithm for path planning optimal routes mobile robot “like a car” to a target in unknown environment. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3

    Modeling of cardiovascular diseases (CVDs) and development of predictive heart risk score by Mirza Rizwan, Sajid

    Published 2021
    “…A novel methodology was used to compute simple heart risk scores called non-laboratory based heart risk score (NLHRS). The methodology is proposed as stacking ensemble ML and the best ML algorithms are used as a base learner to compute relative feature weights. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Quantum Processing Framework And Hybrid Algorithms For Routing Problems by Soltan Aghaei, Mohammad Reza

    Published 2010
    “…The designed hybrid architecture and framework were tested using the above quantum algorithms and the existing quantum algorithms. Implementing and simulating results are then represented based on the probabilistic hybrid algorithm in the case of linear array, binary heap and quantum search for dense and sparse graphs.…”
    Get full text
    Get full text
    Thesis
  6. 6

    Optimizing high-density aquaculture rotifer Detection using deep learning algorithm by Alixson Polumpung, Kit Guan Lim, Min Keng Tan, Sitti Raehanah Muhamad Shaleh, Renee Ka Yin Chin, Kenneth Teo Tze Kin

    Published 2022
    “…Second, is to develop the deep learning algorithm based on YOLOv3. Third step is to training and evaluate the model using loss function. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceedings
  7. 7

    The evolution and trend of chain code scheme by Wulandhari, Lily Ayu, Haron, Habibollah

    Published 2008
    “…This paper explains some chain code concepts and their applications that are be the background of the development of vertex chain code cells algorithm. This algorithm is able to visualize and to transcribe a binary image into vertex chain code easily. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    A novel hybrid binary reconstruction algorithm for ultrasonic tomography by Abdul Rahim, R., Fazalul Rahiman, M. H.

    Published 2008
    “…The algorithm is capable to improve the noise in the conventional back-projection based algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    Enhancing Wearable-Based Human Activity Recognition with Binary Nature-Inspired Optimization Algorithms for Feature Selection by Norfadzlan, Yusup, Izzatul Nabila, Sarbini, Dayang Nurfatimah, Awang Iskandar, Azlan, Mohd Zain, Didik Dwi, Prasetya

    Published 2026
    “…In the experiment, we conducted an evaluation of the effectiveness and efficiency of four nature-inspired binary algorithms for optimization namely Binary Particle Swarm Optimization (BPSO), Binary Grey Wolf Optimization algorithm (BGWO), Binary Differential Evolution algorithm (BDE), and Binary Salp Swarm algorithm (BSS) - in the context of human activity recognition (HAR). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    A Multi-State Gravitational Search Algorithm for Combinatorial Optimization Problems by Ismail, Ibrahim, Zuwairie, Ibrahim, Hamzah, Ahmad, Zulkifli, Md. Yusof

    Published 2015
    “…The binary-based algorithms including the binary gravitational search algorithm (BGSA) were designed to solve discrete optimization problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    Binary search algorithm-based maximum power point tracking for photovoltaic system under partial shaded conditions by Hamdan, Daniyal, Meng, Chung Tiong, Mohd Herwan, Sulaiman

    Published 2018
    “…This paper presents the study on the application of Binary Search Algorithm (BSA) to determine the maximum power point under partially shaded photovoltaic system. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12

    Clustering for binary data sets by using genetic algorithm-incremental K-means by Saharan, S., Baragona, R., Nor, M. E., Salleh, R. M., Asrah, N. M.

    Published 2018
    “…For the purpose of this research, GA was combined with the Incremental Kmeans (IKM) algorithm to cluster the binary data streams. In GAIKM, the objective function was based on a few sufficient statistics that may be easily and quickly calculated on binary numbers. …”
    Get full text
    Get full text
    Article
  13. 13

    Multi-State Particle Swarm Optimization for Discrete Combinatorial Optimization Problem by Ismail, Ibrahim, Hamzah, Ahmad, Zuwairie, Ibrahim, Mohd Falfazli, Mat Jusof, Zulkifli, Md. Yusof, Sophan Wahyudi, Nawawi, Kamal, Khalil, Muhammad Arif, Abdul Rahim

    Published 2014
    “…The binary-based algorithms including the binary particle swarm optimization (BPSO) algorithm are proposed to solve discrete optimization problems. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Quantum-inspired associative memories for incorporating emotion in a humanoid / Naoki Masuyama by Naoki, Masuyama

    Published 2016
    “…In regards to the ability improvements in terms of memory capacity and noise tolerance, the quantum-inspired hetero-association models with batch/incremental learning algorithm are developed based on QHAM. …”
    Get full text
    Get full text
    Thesis
  15. 15

    A novel nonlinear time‑varying sigmoid transfer function in binary whale optimization algorithm for descriptors selection in drug classifcation by Mohd Yusof, Norfadzlia, Muda, Azah Kamilah, Pratama, Satrya Fajri, Abraham, Ajith

    Published 2022
    “…The comparative optimization algorithms include two BWOA variants, binary bat algorithm (BBA), binary gray wolf algorithm (BGWOA), and binary manta-ray foraging algorithm (BMRFO). …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    New Diffie Hellman key exchange primitive based upon binary field by Kanniah, Uma S., Samsudin, Azman

    Published 2013
    “…One of the earliest public-key algorithm is Diffie Hellman key exchange algorithm.The Diffie Hellman key exchange allows two parties that have no prior knowledge of each other to jointly establish a shared secret key over an insecure communications channel.However, one drawback of this algorithm is the inherently expensive exponential calculation that provides the needed one-way trapdoor mechanism.Hence, an alternative approach is proposed whereby the key exchange will no longer depend on the prime field instead the newly proposed algorithm will now depend on the binary field as it is known that binary field operations are inexpensive and provides notably faster computations.The result evidently shows that the binary field Diffie Hellman performs almost twice as fast as the prime field Diffie Hellman.In general, this result serves as an example in which the binary field can benefit the mainstream cryptography. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    An accelerated and accurate three-dimensional ray tracing using red-black tree with facet mining and object bouncing techniques by Islam, M.J., Reza, A.W., Noordin, K.A., Dimyati, K., Kausar, A.M.Z.

    Published 2015
    “…Therefore, this study introduces a new 3D ray tracing algorithm based on a red-black tree with facet mining and object bouncing techniques. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18
  19. 19

    A genetic algorithm to minimise the maximum lateness on a single machine family scheduling problem by Lee, Lai Soon, Nazif, Habibeh

    Published 2009
    “…In the case of large setup time, jobs tend to form a large batch size with more jobs in a batch to reduce the need of setup time between batches from different families. …”
    Get full text
    Conference or Workshop Item
  20. 20