Search Results - candidate determination algorithm

Search alternatives:

Refine Results
  1. 1
    Classification of Short Possessive Clitic Pronoun Nya in Malay Text to Support Anaphor Candidate Determination

    Classification of Short Possessive Clitic Pronoun Nya in Malay Text to Support Anaphor Candidate Determination by Mohd Noor, Noor Huzaimi@Karimah, Mohd Noah, Shahrul Azman, Ab Aziz, Mohd Juzaiddin

    Published 2020
    “…Anaphor candidate determination is an important process in anaphora resolution (AR) systems. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Classification of short possessive clitic pronoun Nya in Malay text to support anaphor candidate determination

    Classification of short possessive clitic pronoun Nya in Malay text to support anaphor candidate determination by Mohd Noor, Noor Huzaimi@Karimah, Mohd Noah, Shahrul Azman, Ab Aziz, Mohd Juzaiddin

    Published 2020
    “…Anaphor candidate determination is an important process in anaphora resolution (AR) systems. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    Efficient prime-based method for interactive mining of frequent patterns.

    Efficient prime-based method for interactive mining of frequent patterns. by Mohammad Hossein, Nadimi Shahraki, Mustapha, Norwati, Sulaiman, Md. Nasir, Mamat, Ali

    Published 2011
    “…During the mining process, the mining algorithm reduces the number of candidate patterns and comparisons by using a new candidate set called candidate head set and several efficient pruning techniques. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Rational drug design using genetic algorithm: case of malaria disease

    Rational drug design using genetic algorithm: case of malaria disease by Al-Safi, Hassen Mohammed, Alshaikhli, Imad Fakhri Taha

    Published 2012
    “…Thus, it can be selected as the anti malaria drug candidate.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    Prime-based method for interactive mining of frequent patterns

    Prime-based method for interactive mining of frequent patterns by Nadimi-Shahraki, Mohammad-Hossein

    Published 2010
    “…It grows an effective candidate head set introduced in this study starting from the longest candidate patterns by using the Apriori principle. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Temporal video segmentation using squared form of Krawtchouk-Tchebichef moments

    Temporal video segmentation using squared form of Krawtchouk-Tchebichef moments by Abdulhussain, Sadiq H.

    Published 2018
    “…In the proposed TVS, a modified candidate segment selection technique is initially employed to determine the candidate segments from the entire video. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Automatic detection of face and facial features

    Automatic detection of face and facial features by Chai, Tong Yuen, Mohd Rizon, Mohamed Juhari, Prof. Dr., Woo, San San, Sugisaka, M.

    Published 2011
    Get full text
    Working Paper
    Save to List
    Saved in:
  8. 8
    A greedy heuristics multiple criteria model for solving multi-landfill site selection and plant propagation algorithm for improving waste collection vehicle routing solutions

    A greedy heuristics multiple criteria model for solving multi-landfill site selection and plant propagation algorithm for improving waste collection vehicle routing solutions by Nur Azriati, Mat

    Published 2023
    “…As for multiple landfills, Candidates 3 and 4 were the best alternative sites. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Determination of a good indicator for estimated prime factor and its modification in Fermat’s Factoring Algorithm

    Determination of a good indicator for estimated prime factor and its modification in Fermat’s Factoring Algorithm by Mohd Tahir, Rasyid Redha, Asbullah, Muhammad Asyraf, Kamel Ariffin, Muhammad Rezal, Mahad, Zahari

    Published 2021
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Dual-Criteria Method For Determining Critical Plane Orientation For Multiaxial Fatigue Prediction Using A Genetic Algorithm

    Dual-Criteria Method For Determining Critical Plane Orientation For Multiaxial Fatigue Prediction Using A Genetic Algorithm by M., Kaamal, M. M., Rahman

    Published 2015
    “…This paper is an attempt to formulate an estimation method which can efficiently determine the critical plane according to the criteria under consideration. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    A generalized laser simulator algorithm for optimal path planning in constraints environment

    A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

    Published 2022
    “…Moreover, the proposed algorithm result are compared to some common algorithms such as the A* algorithm, Probabilistic Road Map, RRT, Bi-directional RRT, and Laser Simulator algorithm to demonstrate its effectiveness. …”
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    A Modified Gravitational Search Algorithm for Discrete Optimization Problem

    A Modified Gravitational Search Algorithm for Discrete Optimization Problem by Zuwairie, Ibrahim, Zulkifli, Md. Yusof, Shahdan, Sudin, Sophan Wahyudi, Nawawi, Amar Faiz, Zainal Abidin, Muhammad Arif, Abdul Rahim, Kamal, Khalil

    Published 2014
    “…Both the direction and velocity determine the candidates of integer values for the position update of an agent and then the selection is done randomly. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Differential evolution for urban transit routing problem

    Differential evolution for urban transit routing problem by Buba, Ahmed Tarajo, Lai, Soon Lee

    Published 2016
    “…In addition, the proposed DE algorithm outperformed most of the published results in the literature.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Fraud detection in telecommunication industry using Gaussian mixed model

    Fraud detection in telecommunication industry using Gaussian mixed model by Mohd Yusoff, Mohd Izhan, Mohamed, Ibrahim, Abu Bakar, Mohd Rizam

    Published 2013
    “…The expectation maximization algorithm is used to estimate the parameter of the model such that the initial values of the algorithm is determined using the kernel method. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  15. 15
    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
    “…The MSAP is a discrete model where a specified number of facilities that achieve the best objective function value of the model are selected out of a finite set of candidate sites. A method involving multi criteria analysis was introduced to determine candidate sites in a per zone basis. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Determining prominent research area and expertise from scholarly data using spherical K-Means algorithm and scholar ranking model

    Determining prominent research area and expertise from scholarly data using spherical K-Means algorithm and scholar ranking model by Sarasjati, Wendy

    Published 2017
    “…Thus, this study will investigate how the prominent research area can be determined by using Spherical K-Means algorithm to cluster the topics. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Efficient distance computation algorithm between nearly intersect objects using dynamic pivot point in virtual environment application

    Efficient distance computation algorithm between nearly intersect objects using dynamic pivot point in virtual environment application by Sulaiman, Hamzah Asyrani, Bade, Abdullah, Abdullah, Mohd Harun

    Published 2013
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  18. 18
    Efficient distance computation algorithm between nearly intersected objects using dynamic pivot point in virtual environment application

    Efficient distance computation algorithm between nearly intersected objects using dynamic pivot point in virtual environment application by Hamzah Asyrani Sulaiman, Abdullah Bade, Mohd Harun Abdullah

    Published 2014
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  19. 19
    A fast discrete gravitational search algorithm

    A fast discrete gravitational search algorithm by Hasrul, Che Shamsudin, Addie Irawan, Hashim, Zuwairie, Ibrahim, Amar Faiz, Zainal Abidin, Sophan Wahyudi, Nawawi, Muhammad Arif, Abdul Rahim, Kamal, Khalil

    Published 2012
    “…Both the direction and velocity determine the candidates of integer values for the position update of an agent and then the selection is done randomly. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  20. 20
    Cluster head selection using fuzzy logic and chaotic based genetic algorithm in wireless sensor network

    Cluster head selection using fuzzy logic and chaotic based genetic algorithm in wireless sensor network by Karimi, Abbas, Abedini, S. M., Zarafshan, Faraneh, Syed Mohamed, Syed Abdul Rahman Al-Haddad

    Published 2013
    “…In other words, fuzzy logic is proposed based on three variables- energy, density and centrality-to introduce the best nodes to base station as cluster head candidate. Then, the number and place of cluster heads are determined in base station by using genetic algorithm based on chaotic. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: