Search Results - (( based method partitioning algorithm ) OR ( java implementation path algorithm ))

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

“…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

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

“…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

Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

“…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
Get full text
Get full text

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

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

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

“…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

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

“…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

Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

“…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
Get full text
Get full text

Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

“…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
Get full text
Get full text
Get full text
Get full text

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

“…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

A partition based feature selection approach for mixed data clustering / Ashish Dutt by Ashish , Dutt

Get full text
Get full text
Get full text

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

“…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

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

“…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

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

“…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

Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

“…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
Get full text
Get full text

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

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

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

“…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

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

“…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

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

“…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

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

“…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

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

“…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