Search Results - (( java location based algorithm ) OR ( using mean problem algorithm ))

Refine Results
  1. 1

    Fuzzy-based multi-agent approach for reliability assessment and improvement of power system protection by Nadheer Abdulridha, Shalash

    Published 2015
    “…The second agent is a reliability evaluation agent that uses a recursive algorithm to predict the suitability generator based on the frequency and duration reliability indices in each state while the third agent is the storage and transfer of data between the other two agents. …”
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3

    Group formation using genetic algorithm by Che Ani, Zhamri, Husin, Mohd Zabidin, Yasin, Azman

    Published 2009
    “…However, due to lack of programming skills especially in Java programming language and the inability to have meetings frequently among the group members,most of the students’ software project cannot be delivered successfully.To solve this problem, systematic group formation is one of the initial factors that should be considered to ensure that every group consists of quality individuals who are good in Java programming and also to ensure that every group member in a group are staying closer to each other.In this research, we propose a method for group formation using Genetic Algorithms, where the members for each group will be generated based on the students’ programming skill and location of residential colleges.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  4. 4

    Multi-floor indoor location estimation system based on wireless local area network by Chua, Tien Han

    Published 2007
    “…The most probable match is selected and returned as estimated location based on Bayesian filtering algorithm. Estimated location is reported as physical location and symbolic location. …”
    Get full text
    Get full text
    Thesis
  5. 5
  6. 6

    Statistical data preprocessing methods in distance functions to enhance k-means clustering algorithm by Dalatu, Paul Inuwa

    Published 2018
    “…It is attained successfully by combining the mean in K-Means algorithm, minimum and maximum in K-Midranges algorithm and compute their average as mean cluster of Hybrid mean. …”
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7

    Improved clustering using robust and classical principal component by Hassn, Ahmed Kadom

    Published 2017
    “…To remedy this problem, we propose to integrate Principal Component analysis (PCA) which is useful for dimensionality reduction of a dataset with the k-means clustering algorithm. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim by Hashim, Siti Zuraifah

    Published 2007
    “…It makes use of three basic operations in order to optimize this problem. …”
    Get full text
    Get full text
    Thesis
  9. 9

    An improvement of stochastic gradient descent approach for mean-variance portfolio optimization problem by S. W. Su, Stephanie, Kek, Sie Long

    Published 2021
    “…Furthermore, the applicability of SGD, Adam, AdaMax, Nadam, AMSGrad, and AdamSE algorithms in solving the mean-variance portfolio optimization problem is validated.…”
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    Improved stochastic gradient descent algorithm with mean-gradient adaptive stepsize for solving large-scale optimization problems by Zulkifli, Munierah, Abd Rahmin, Nor Aliza, Wah, June Leong

    Published 2023
    “…Stochastic gradient descent (SGD) is one of the most common algorithms used in solving large unconstrained optimization problems. …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11

    Efficient genetic partitioning-around-medoid algorithm for clustering by Garib, Sarmad Makki Mohammed

    Published 2019
    “…These algorithms mostly built upon the partitioning k-means clustering algorithm. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Modeling and Analysis of New Hybrid Clustering Technique for Vehicular Ad Hoc Network by Abdulrazzak H.N., Hock G.C., Mohamed Radzi N.A., Tan N.M.L., Kwong C.F.

    Published 2023
    “…To address these problems, a novel method combining a covering rough set and a K-Means clustering algorithm (RK-Means) was proposed in this paper. …”
    Article
  13. 13

    Fuzzy C-Mean And Genetic Algorithms Based Scheduling For Independent Jobs In Computational Grid by Lorpunmanee, Siriluck, Md Sap, Mohd Noor, Abdullah, Abdul Hanan

    Published 2006
    “…In this paper, we combine Fuzzy C-Mean and Genetic Algorithms which are popular algorithms, the Grid can be used for scheduling. …”
    Get full text
    Get full text
    Article
  14. 14

    Effect of adopting different dispatching rules on the mean flow time in a two machine batch-shop problem by Abdelraheem Elhaj, Hazir Farouk

    Published 2005
    “…This means that it is highly unlikely to find a polynomial algorithm to solve the problem. …”
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

    Hybrid multiobjective genetic algorithm for integrated dynamic scheduling and routing of jobs and automated guided vehicles in flexible manufacturing systems by Umar, Umar Ali

    Published 2014
    “…Genetic algorithm has recorded of huge success in solving NP-Complete optimization problems with similar nature to this problem. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Comparison of expectation maximization and K-means clustering algorithms with ensemble classifier model by Sulaiman, Md. Nasir, Mohamed, Raihani, Mustapha, Norwati, Zainudin, Muhammad Noorazlan Shah

    Published 2018
    “…EM and K-means clustering algorithms are used to cluster the multi-class classification attribute according to its relevance criteria and afterward, the clustered attributes are classified using an ensemble random forest classifier model. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    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
    “…Background and Objective: The process of solving the Maximum Clique (MC) problem through approximation algorithms is harder, however, the Maximum Vertex Cover (MVC) problem can easily be solved using approximation algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Optimized clustering with modified K-means algorithm by Alibuhtto, Mohamed Cassim

    Published 2021
    “…Clustering technique is able to find hidden patterns and to extract useful information from huge data. Among the techniques, the k-means algorithm is the most commonly used technique for determining optimal number of clusters (k). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19
  20. 20

    Mathematical simulation for 3-dimensional temperature visualization on open source-based grid computing platform by Alias, Norma, Satam, Noriza, Abd. Ghaffar, Zarith Safiza, Darwis, Roziha, Hamzah, Norhafiza, Islam, Md. Rajibul

    Published 2009
    “…The development of this architecture is based on several programming language as it involves algorithm implementation on C, parallelization using Parallel Virtual Machine (PVM) and Java for web services development. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item