Search Results - (( java simulation optimization algorithm ) OR ( based method partitioning algorithm ))

Refine Results
  1. 1

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

    Published 2012
    “…In the first and second phases, a threshold fuzzy c-means clustering algorithm as a clusterer and a pattern ensemble learning method based on the incremental genetic-based algorithms are proposed respectively. …”
    Get full text
    Get full text
    Thesis
  2. 2

    A new framework for multi-partition finite state machine low power design based on genetic algorithm by Masoumidezfouli, Seyedhossein

    Published 2018
    “…Many researchers use a variety of algorithms to optimize a solution. Among these methods is the genetic algorithm (GA)-based optimization, that technique shows a high performance to reduce FSM power consumption. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Cluster Analysis of Data Points using Partitioning and Probabilistic Model-based Algorithms by Raheem, Ajiboye Adeleke, Hauwau, Isah-Kebbe, O., Oladele Tinuke

    Published 2014
    “…This study explores the performance accuracies of partitioning-based algorithms and probabilistic model-based algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Solving the minimum dominating set problem of partitioned graphs using a hybrid bat algorithm by Abed, S.A., Rais, H.M.

    Published 2020
    “…To analyse the performance of the proposed partitioning scheme, we experimented with the hybrid algorithm on the graph, with and without partitioning. …”
    Get full text
    Get full text
    Article
  5. 5

    A study on the VLSI partitions: the implementation of Fiduccia-Mattheyses algorithm / Burhanuddin Omar by Omar, Burhanuddin

    Published 1997
    “…The program is being develop using this algorithm. The evaluation and comparison also been carried out between this method and Kernighan-Lin method.…”
    Get full text
    Get full text
    Thesis
  6. 6

    Topology-aware hypergraph based approach to optimize scheduling of parallel applications onto distributed parallel architectures by Koohi, Sina Zangbari

    Published 2020
    “…This thesis provides a new topology-aware multi-level hypergraph partitioning schema to tackle this issue. The proposed partitioning scheme has based on a multi-level partitioning approach which consists of three main steps. …”
    Get full text
    Get full text
    Thesis
  7. 7
  8. 8

    A BBN-based framework for adaptive IP-reuse by Azman, Amelia Wong, Bigdeli, Abbas, Biglari-Abhari, Morteza, Mohd Mustafah, Yasir, Lovell, Brian

    Published 2009
    “…This paper presents a novel research work of a hybrid HW/SW partitioning method that combines heuristic and knowledge-based approaches to satisfy user-defined constraints. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  9. 9

    Ant system-based feature set partitioning algorithm for classifier ensemble construction by Abdullah, , Ku-Mahamud, Ku Ruhana

    Published 2016
    “…In this study, Ant system-based feature set partitioning algorithm for classifier ensemble construction is proposed.The Ant System Algorithm is used to form an optimal feature set partition of the original training set which represents the number of classifiers.Experiments were carried out to construct several homogeneous classifier ensembles using nearest mean classifier, naive Bayes classifier, k-nearest neighbor and linear discriminant analysis as base classifier and majority voting technique as combiner. …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    A balanced partitioning mechanism for multicontroller placement in software-defined wide area networks by Saab, Maher Waleed Asaad

    Published 2022
    “…Moreover, the BPM is designed based on a modified K-means algorithm. BPM comprises of two approaches: the initialization method and the partitioning strategy. …”
    Get full text
    Get full text
    Thesis
  11. 11
  12. 12

    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
  13. 13

    Robust partitioning and indexing for iris biometric database based on local features by Khalaf, Emad Taha, Mohammed, Muamer N., Kohbalan, Moorthy

    Published 2018
    “…Further, the scalable K-means++ algorithm is used for partitioning and classification processes, and an efficient parallel technique that divides the features groups causing the formation of two b-trees based on index keys is applied for search and retrieval. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Clock Distribution Network Building Algorithm For Multiple Ips In System On A Chip by Tan , Tze Liang

    Published 2017
    “…In this project, an algorithm is proposed and developed to build the global CDN that is used to distribute the clocks to all partitions in the SoC using the channels available between partitions. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16

    Dynamic partitioning and data allocation method on heterogeneous architecture / Muhammad Helmi Rosli by Rosli, Muhammad Helmi

    Published 2015
    “…Most cluster environment have a variety of computer hardware specification namely heterogeneous environment.Optimizing the resources in heterogeneous environment during parallel processing is not a simple task. These involves partitioning and allocating task to each cluster node.The aim of these research is to investigate various method of partitioning and allocating task in cluster environment and produce a dynamic partitioning and allocating method. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    “…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
    Get full text
    Get full text
    Get full text
    Monograph
  18. 18

    Partitional clustering algorithms for highly similar and sparseness y-short tandem repeat data / Ali Seman by Seman, Ali

    Published 2013
    “…This uniqueness of Y-STR data has become problematic in partitioning the data using the existing partitional clustering algorithms. …”
    Get full text
    Get full text
    Thesis
  19. 19

    New methods of partial transmit sequence for reducing the high peak-to-average-power ratio with low complexity in the ofdm and f-ofdm systems by Abduljabbar, Yasir Amer

    Published 2019
    “…Based on the proposed methods, an improved PTS method that merges the best subblock partitioning scheme in the frequency domain and the best low-complexity algorithm in the time domain has been introduced to enhance the PAPR reduction performance better than the conventional PTS method with extremely low computational complexity level. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20

    Partitioning techniques and their parallelization for stiff system of ordinary differential equations by Othman, Khairil Iskandar

    Published 2007
    “…Partitioning this block method to solve stiff differential equations is a new strategy; it is more efficient and takes less computational time compared to the sequential methods. …”
    Get full text
    Get full text
    Thesis