Search Results - (( develop complex graph algorithm ) OR ( java simulation optimization algorithm ))
Search alternatives:
- develop complex »
- graph algorithm »
- java simulation »
- complex graph »
-
1
An improved algorithm for channel allocation on direct sequence spread spectrum
Published 2011“…Meanwhile between the VMA and Dsatur algorithm in the complex graph is equivalent to 18.1%.However,VMA and Welsh Powell algorithm is not compared in the complex graph since its drawback in terms of not fulfill the graph coloring concept.This is because there are two adjacent vertices have the same color.Overall, even there is no reduction for number of required channel among VMA,Dsatur algorithm and Welsh Powell algorithm in the simple graph,but the outstanding significant contribution of VMA since it has reduction in the complex graph.…”
Get full text
Get full text
Thesis -
2
Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing
Published 2007“…For design validation and performance test purposes, a computationally expensive VLSI interconnect routing Computer Aided Design (CAD) module is developed. Results of the performance tests on the proposed hardware graph accelerator, graph computations are significantly improved in terms of algorithm complexity and execution speed.…”
Get full text
Get full text
Get full text
Thesis -
3
Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article
Published 2010“…The existing Smith-Waterman algorithm had complex memory and low performance where the time also was consumed caused by high sensitivity of the large sequences long. …”
Get full text
Get full text
Article -
4
Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator
Published 2010“…The existing Smith-Waterman algorithm had complex memory and low performance where the time also was consumed caused by high sensitivity of the large sequences long. …”
Get full text
Get full text
Student Project -
5
Parameter estimation of multivariable system using Fuzzy State Space Algorithm / Razidah Ismail … [et al.]
Published 2011“…Fuzzy State Space Model (FSSM) was developed to cope with the demand and performance due to the increase in the system complexity. …”
Get full text
Get full text
Research Reports -
6
COVID-19 DATA EXPLORATION USING MAPPER ALGORITHM
Published 2023“…The resulting mapper graphs reveal the pandemic’s development progress across time and place during year 2021. …”
Get full text
Get full text
Final Year Project Report / IMRAD -
7
Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection
Published 2022“…The simulation is implemented with iFogSim and java programming language. …”
Get full text
Get full text
Article -
8
An Improved-Time Polynomial-Space Exact Algorithm For TSP In Degree-5 Graphs
Published 2017“…Following a recent trend of research which focuses on developing algorithms for special types of TSP instances, namely graphs of limited degree, in an attempt to reduce a part of the time and space complexity, we present a polynomial-space branching algorithm for the TSP in an n-vertex graph with degree at most 5, and show that it has a running time of O∗(2.3500n), which improves the previous best known time bound of O∗(2.4723n) given by the authors (the 12th International Symposium on Operations Research and Its Application (ISORA 2015), pp.45–58, 2015). …”
Get full text
Get full text
Get full text
Get full text
Article -
9
Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences
Published 2024journal::journal article -
10
Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing
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 -
11
Ant colony optimization algorithm for load balancing in grid computing
Published 2012“…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
Get full text
Get full text
Get full text
Monograph -
12
OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT
Published 2023“…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”
Review -
13
Laser simulator: a novel search graph-based path planning approach
Published 2018“…A novel technique called laser simulator approach for visibility search graph-based path planning has been developed in this article to determine the optimum collision-free path in unknown environment. …”
Get full text
Get full text
Get full text
Article -
14
A Divide-and-Distribute Approach to Single-Cycle Learning HGN Network for Pattern Recognition
Published 2010“…Distributed Hierarchical Graph Neuron (DHGN) is a single-cycle learning distributed pattern recognition algorithm, which reduces the computational complexity of existing pattern recognition algorithms by distributing the recognition process into smaller clusters. …”
Get full text
Get full text
Conference or Workshop Item -
15
Robust overlapping community detection in complex networks with graph convolutional networks and fuzzy C-means
Published 2024“…In this paper, we propose an efficient method called GCNFCM, which utilizes Graph Convolutional Networks (GCNs), Fuzzy C-means (FCM), and the modularity Q algorithm for overlapping community detection. …”
Get full text
Get full text
Get full text
Article -
16
Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization
Published 2019“…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
Get full text
Get full text
Thesis -
17
Features selection for intrusion detection system using hybridize PSO-SVM
Published 2016“…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
Get full text
Get full text
Thesis -
18
Quantum Processing Framework And Hybrid Algorithms For Routing Problems
Published 2010“…Another quantum algorithm for a minimum weight spanning tree in the graph was also designed. …”
Get full text
Get full text
Thesis -
19
Resource management in grid computing using ant colony optimization
Published 2011“…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion 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 other ant based algorithm, in terms of resource utilization.Experimental results show that EACO produced better grid resource management solution.…”
Get full text
Get full text
Get full text
Get full text
Monograph -
20
The conceptual framework of knowledge of large scale and incomplete graphs of skyline queries optimization using machine learning
Published 2025“…These continuous updates makes the graph to be highly dynamic, where nodes/edges are added to or removed from the graph always. …”
Get full text
Get full text
Get full text
Get full text
Proceeding Paper
