Search Results - (( initial solution towards algorithm ) OR ( java implication based algorithm ))

Search alternatives:

Refine Results
  1. 1
    Initialization Methods For Conventional Fuzzy C-Means And Its Application Towards Colour Image Segmentation

    Initialization Methods For Conventional Fuzzy C-Means And Its Application Towards Colour Image Segmentation by Tan , Khang Siang

    Published 2011
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Clustering ensemble learning method based on incremental genetic algorithms

    Clustering ensemble learning method based on incremental genetic algorithms by Ghaemi, Reza

    Published 2012
    “…Firstly, an architecture for the clustering ensemble based on incremental genetic-based algorithms is proposed consisting of two phases: (i) to produce cluster partitions as initial populations, (ii) to combine cluster partitions and to generate final clustering solution by incremental genetic based clustering ensemble learning algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    An investigation towards hostel space allocation problem with stochastic algorithms

    An investigation towards hostel space allocation problem with stochastic algorithms by Joe Henry Obit, Kuan, Yik Junn, Rayner Alfred, Jetol Bolongkikit, Ong, Yan Sheng

    Published 2018
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  4. 4
    Enhanced segment particle swarm optimization for large-scale kinetic parameter estimation of escherichia coli network model

    Enhanced segment particle swarm optimization for large-scale kinetic parameter estimation of escherichia coli network model by Mohammed Adam, Kunna Azrag

    Published 2021
    “…Initially, PSO algorithm was adapted to find the globally optimal result based on unorganized particle movement in the search space toward the optimal solution. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    GENETIC ALGORITHM WITH DEEP NEURAL NETWORK SURROGATE FOR THE OPTIMIZATION OF ELECTROMAGNETIC STRUCTURE

    GENETIC ALGORITHM WITH DEEP NEURAL NETWORK SURROGATE FOR THE OPTIMIZATION OF ELECTROMAGNETIC STRUCTURE by MOHAMMED SHARIFF, NUR ATIQAH

    Published 2020
    “…The behavior of Genetic Algorithm (GA) where it generates and evolves the parameters towards a high-quality solution gives an advantage in obtaining ideal combination of parameters to fit in with the simulation. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  6. 6
    An improved bat algorithm with artificial neural networks for classification problems

    An improved bat algorithm with artificial neural networks for classification problems by Rehman Gillani, Syed Muhammad Zubair

    Published 2016
    “…Then, the proposed BAGD algorithm is frnther hybridized with Simulated Annealing (SA) and Genetic Algorithm (GA) to perform two stage optimization in which the former algorithm finds the optimal solution and the latter algorithm starts from where the first one is converged. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Application Of Genetic Algorithms For Robust Parameter Optimization

    Application Of Genetic Algorithms For Robust Parameter Optimization by Belavendram, N.

    Published 2010
    “…Factors in a parameter design can be expressed as a genetic analogue in a pool of sub-optimal random solutions. Allowing this pool of sub-optimal solutions to evolve over several generations produces fitter generations converging to a pre-defined engineering optimum. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    A Tabu Search Approach with Embedded Nurse Preferences for Solving Nurse Rostering Problem

    A Tabu Search Approach with Embedded Nurse Preferences for Solving Nurse Rostering Problem by Ramli, Razamin, Ahmad, Siti Nurin Ima, Abdul-Rahman, Syariza, Wibowo, Antoni

    Published 2020
    “…The methodology consists of two phases: initialization and neighborhood. The semi-random initialization is employed for finding a good initial solution during the initialization phase which avoids the violation of hard constraints, while the neighborhood phase is established for further improving the solution quality with a special representation and innovative neighborhood generations within TS algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    A tabu search approach with embedded nurse preferences for solving nurse rostering problem

    A tabu search approach with embedded nurse preferences for solving nurse rostering problem by Ramli, Razamin, Ahmad, Siti Nurin Ima, Abdul-Rahman, Syariza, Wibowo, Antoni

    Published 2020
    “…The methodology consists of two phases: initialization and neighborhood. The semi-random initialization is employed for finding a good initial solution during the initialization phase which avoids the violation of hard constraints, while the neighborhood phase is established for further improving the solution quality with a special representation and innovative neighborhood generations within TS algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    The implications for ahybrid detection technique against malicious sqlattacks on web applications

    The implications for ahybrid detection technique against malicious sqlattacks on web applications by Bahjat Arif, Sarajaldeen Akram, Wani, Sharyar

    Published 2025
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    A hybrid SP-QPSO algorithm with parameter free adaptive penalty method for constrained global optimization problems

    A hybrid SP-QPSO algorithm with parameter free adaptive penalty method for constrained global optimization problems by Fatemeh, D. B., Loo, C. K., Kanagaraj, G., Ponnambalam, S. G.

    Published 2018
    “…Further, the algorithm’s performance is improved by Centroidal Voronoi Tessellations method of point initialization promise to visit the entire search space. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    A Modified ACO-based Search Algorithm for Detecting Protein Functional Module From Protein Interaction Network

    A Modified ACO-based Search Algorithm for Detecting Protein Functional Module From Protein Interaction Network by Jamaludin, Sallim, Rozlina, Mohamed, Roslina, Abd Hamid

    Published 2015
    “…The search process of ACO-PFMDM has converged effectively compared to some state-of-art algorithms. Moreover, the proposed dynamic update of the heuristic parameters based on entropy has generated high quality tours and it can guide ants toward the effective solutions space in the initial search stages.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  13. 13
    Partial examination assignment approaches for solving examination timetabling problems

    Partial examination assignment approaches for solving examination timetabling problems by Mandal, Ashis Kumar

    Published 2016
    “…However, these traditional approaches bias toward the initial timetable where the improvement algorithms (sometimes) are affected and unable to produce a quality timetable. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system

    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
    “…Dijkstra and ACO are integrated to produce the smart guidance algorithm for the indoor parking system. Dijkstra algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    A Hybrid ACO-Graph Entropy for Functional Modules Detection From Protein-Protein Interaction Network

    A Hybrid ACO-Graph Entropy for Functional Modules Detection From Protein-Protein Interaction Network by Jamaludin, Sallim, Rozlina, Mohamed, Che, Yahaya, Roslina, Abdul Hamid

    Published 2018
    “…The search process of ACO-PFMDM has converged effectively compared to some state-of-art algorithms. Moreover, the proposed dynamic update of the heuristic parameters based on entropy has generated high quality tours and it can guide ants toward the effective solutions space in the initial search stages.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Improved cuckoo search based neural network learning algorithms for data classification

    Improved cuckoo search based neural network learning algorithms for data classification by Abdullah, Abdullah

    Published 2014
    “…In the proposed HACPSO algorithm, initially accelerated particle swarm optimization (APSO) algorithm searches within the search space and finds the best sub-search space, and then the CS selects the best nest by traversing the sub-search space. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Ball surface representations using partial differential equations

    Ball surface representations using partial differential equations by Kherd, Ahmad Saleh Abdullah

    Published 2015
    “…Hence, this new algorithm is a viable alternative for constructing generalized Ball surfaces. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Potential of data minimization techniques approach in improving DNA sequences alignment and comparison / Syed Abdul Mutalib Al Junid … [et al.]

    Potential of data minimization techniques approach in improving DNA sequences alignment and comparison / Syed Abdul Mutalib Al Junid … [et al.] by Al Junid, Syed Abdul Mutalib, Haron, Muhammad Adib, Abd Majid, Zulkifli, Othman, Zulkifli

    Published 2012
    “…This study will initially involve algorithm modification, mathematical formulation, logic design and simulation for data minimization and existing DNA sequences alignment algorithm. …”
    Get full text
    Get full text
    Research Reports
    Save to List
    Saved in:
  19. 19
    Dual optimization approach in discrete Hopfield neural network

    Dual optimization approach in discrete Hopfield neural network by Guo, Yueling, Zamri, Nur Ezlin, Mohd Kasihmuddin, Mohd Shareduwan, Alway, Alyaa, Mansor, Mohd. Asyraf, Li, Jia, Zhang, Qianhong

    Published 2024
    “…Quantitative evaluations show that the proposed model successfully enhances the optimization of both phases, ranking first compared to 10 recent algorithms for all metrics. In terms of convergence analysis, the proposed model progressed fast towards the optimal solution with only one iteration for all cases. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Study towards real time precise point positioning systems using GPS engine receiver

    Study towards real time precise point positioning systems using GPS engine receiver by Mohd. Omar, Kamaludin, Subari, Mustafa Din

    Published 2004
    “…The precise single point positioning using single frequency GPS receiver is one of the challenging researches. This study was to initial study towards development of the precise single point position solution with accuracy better than 2 m using a low cost single frequency GPS receiver. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:

Search Tools: