Search Results - (( solution location selection algorithm ) OR ( java application mining algorithm ))

Search alternatives:

Refine Results
  1. 1
    Direct approach for mining association rules from structured XML data

    Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

    Published 2012
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection

    Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection by Saputra , Dhany, Rambli, Dayang R.A., Foong, Oi Mean

    Published 2008
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Study and Implementation of Data Mining in Urban Gardening

    Study and Implementation of Data Mining in Urban Gardening by Mohana, Muniandy, Lee, Eu Vern

    Published 2019
    “…Attached sensors generate data and send these data to the Java Servlet application through a WIFI module. These data are processed and stored in appropriate formats in a MySQL server database. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem

    Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem by Nurhazwani, Ahmad Razak

    Published 2021
    “…Random selection of facility location in a Cell-based approach may cause infeasible or worse solutions. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Mining Sequential Patterns Using I-PrefixSpan

    Mining Sequential Patterns Using I-PrefixSpan by Dhany , Saputra, Rambli Dayang, R.A., Foong, Oi Mean

    Published 2007
    “…Sequential pattern mining is a relatively new data-mining problem with many areas of application. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  6. 6
    A web-based implementation of k-means algorithms

    A web-based implementation of k-means algorithms by Lee, Quan

    Published 2022
    “…This stinginess of proximity measures in data mining tools is stifling the performance of the algorithm. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  7. 7
    Harmony search algorithm for curriculum-based course timetabling problem

    Harmony search algorithm for curriculum-based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2013
    “…In this paper, harmony search algorithm is applied to curriculum-based course timetabling.The implementation, specifically the process of improvisation consists of memory consideration, random consideration and pitch adjustment.In memory consideration, the value of the course number for new solution was selected from all other course number located in the same column of the Harmony Memory.This research used the highest occurrence of the course number to be scheduled in a new harmony.The remaining courses that have not been scheduled by memory consideration will go through random consideration, i.e. will select any feasible location available to be scheduled in the new harmony solution. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Harmony search algorithm for curriculum-based course timetabling problem

    Harmony search algorithm for curriculum-based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2013
    “…However, the algorithm produced results that were not comparatively better than those previously known as best solution.With proper modification in terms of the approach in this algorithm would make the algorithm perform better on curriculum-based course timetabling.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  9. 9
    Mining Sequential Patterns using I-PrefixSpan

    Mining Sequential Patterns using I-PrefixSpan by Saputra , Dhany, Dayang R.A. Rambli, Foong, Oi Mean

    Published 2008
    Get full text
    Get full text
    Citation Index Journal
    Save to List
    Saved in:
  10. 10
    Context Aware Handover Algorithms For Mobile Positioning Systems

    Context Aware Handover Algorithms For Mobile Positioning Systems by Zaman Khan, Sazid, Thilek, Silvadorai, Tan, Chen Wei, Ramadass, Sureswaran, Anwar, Toni

    Published 2014
    “…The performance of the proposed solution was tested in selected experimental areas. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Modified K-Nearest Neighborhood Algorithm For Optimal Selection Of Distribution Centre In The Disaster Relief Operation

    Modified K-Nearest Neighborhood Algorithm For Optimal Selection Of Distribution Centre In The Disaster Relief Operation by Siti Nabilah Basarang

    Published 2024
    thesis::master thesis
    Save to List
    Saved in:
  12. 12
    OPTIMAL LOCATION SELECTION OF SOURCE SUBSTATION OF POWER DISTRIBUTION NETWORK

    OPTIMAL LOCATION SELECTION OF SOURCE SUBSTATION OF POWER DISTRIBUTION NETWORK by Ab Ghani, Mohd Ruddin

    Published 1999
    “…A new computer algorithm and program is presented in this paper for optimal location selection od source substation and optimal feeder selection in power distribution network. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  13. 13
    Mobile user location prediction: genetic algorithm-based approach

    Mobile user location prediction: genetic algorithm-based approach by Mantoro, Teddy, Muataz, Zubaidah, Ayu, Media Anugerah

    Published 2010
    “…This paper presents a prediction of user location using genetic algorithm and based location history in finding a number of solutions of possible location when applied to recorded context histories, framework is presented and the result are discussed. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  14. 14
    Agreement options for negotiation on material location decision of housing development

    Agreement options for negotiation on material location decision of housing development by Utomo, C., Rahmawati, Y.

    Published 2020
    “…Application of coalition formation for agreement options is used to select the best fit material location. It is based on satisficing game theory rather than optimization. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Development of integrated models for distribution network design of perishable products

    Development of integrated models for distribution network design of perishable products by Firoozi, Zahra

    Published 2015
    “…A Lagrangian relaxationbased heuristic algorithm is developed to solve the model. The algorithm produces solutions that are within 0.027% of optimality gap.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Solving vehicle routing problem by using improved genetic algorithm for optimal solution

    Solving vehicle routing problem by using improved genetic algorithm for optimal solution by Mohammed M.A., Abd Ghani M.K., Hamed R.I., Mostafa S.A., Ahmad M.S., Ibrahim D.A.

    Published 2023
    Article
    Save to List
    Saved in:
  17. 17
    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
    “…Second, the Plant Propagation Algorithm (PPA) has never been considered to solve WCVRP. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Cloudlet deployment and task offloading in mobile edge computing using variable-length whale and differential evolution optimization and analytical hierarchical process for decision-making

    Cloudlet deployment and task offloading in mobile edge computing using variable-length whale and differential evolution optimization and analytical hierarchical process for decisio... by Daba, Layth Muwafaq Abdulhussein

    Published 2023
    “…Furthermore, it enables non-dominated evaluation of solutions based on four objectives using crowding distance for selection. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    An Efficient Solution to Travelling Salesman Problem using Genetic Algorithm with Modified Crossover Operator

    An Efficient Solution to Travelling Salesman Problem using Genetic Algorithm with Modified Crossover Operator by Hossain, Md. Sabir, Tanim, Ahsan Sadee, Choudhury, Sadman Sakib, Hayat, S. M. Afif Ibne, M. Nomani, Kabir, Islam, Mohammad Mainul

    Published 2019
    “…This paper proposes an efficient and effective solution for solving such a query. A modified crossover method using Minimal Weight Variable, Order Selection Crossover operator, a modified mutation using local optimization and a modified selection method using KMST is proposed. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Performance Enhancement Of Artificial Bee Colony Optimization Algorithm

    Performance Enhancement Of Artificial Bee Colony Optimization Algorithm by Abro, Abdul Ghani

    Published 2013
    “…To overcome the problems, this research work has proposed few modified and new ABC variants; Gbest Influenced-Random ABC (GRABC) algorithm systematically exploits two different mutation equations for appropriate exploration and exploitation of search-space, Multiple Gbest-guided ABC (MBABC) algorithm enhances the capability of locating global optimum by exploiting so-far-found multiple best regions of a search-space, Enhanced ABC (EABC) algorithm speeds up exploration for optimal-solutions based on the best so-far-found region of a search-space and Enhanced Probability-Selection ABC (EPS-ABC) algorithm, a modified version of the Probability-Selection ABC algorithm, simultaneously capitalizes on three different mutation equations for determining the global-optimum. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: