Search Results - optimal ((((((graph algorithm) OR (drops algorithm))) OR (window algorithm))) OR (based algorithm))
Search alternatives:
- window algorithm »
- graph algorithm »
-
1
Fair bandwidth distribution marking and scheduling algorithm in network traffic classification
Published 2019“…Second, an Optimized time sliding window packet marker (OTSWTCM) algorithm. …”
Get full text
Get full text
Thesis -
2
Optimized crossover genetic algorithm for vehicle routing problem with time windows
Published 2010“…Conclusion/Recommendations: This study presented a genetic algorithm for solving vehicle routing problem with time windows using an optimized crossover operator. …”
Get full text
Get full text
Get full text
Article -
3
Benchmark simulator with dynamic environment for job scheduling in grid computing
Published 2014“…Characteristics of jobs and resources to be used in evaluating the performance of the scheduling algorithm must reflect the dynamic nature of real grid environment.Static models of jobs and resources cannot be used to generate jobs and resources in simulating the grid environment because of the dynamic nature of the grid.This paper presents a new graph representation of jobs and resources which is practical for hybrid metaheuristic model implementation such as ant colony optimization and genetic algorithm.A dynamic model that can generate jobs and resources similar to the jobs and resources in the real grid environment is also proposed.Jobs and resources may join in or drop out from the grid.Stochastic analysis is performed on the characteristics of jobs and resources.A simulator based on the dynamic expected time to compute, has been developed and can be used as a benchmark.The simulator can generate jobs and resources with the characteristics of jobs and resources in the real grid environment.This will facilitates the evaluation of dynamic job scheduling algorithm.…”
Get full text
Get full text
Get full text
Conference or Workshop Item -
4
-
5
Analysis and modeling of database storage optimization power consumption usage for green data centers
Published 2014“…The proxies can be discovered by using a developed algorithm of functional dependencies (FDs) called as TANE algorithm. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
6
Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences
Published 2024journal::journal article -
7
Stochastic partially optimized cyclic shift crossover for multi-objective genetic algorithms for the vehicle routing problem with time-windows
Published 2017“…This paper presents a stochastic partially optimized cyclic shift crossover operator for the optimization of the multi-objective vehicle routing problem with time windows using genetic algorithms. …”
Get full text
Get full text
Article -
8
Solving university examination timetabling problem using intelligent water drops algorithm
Published 2024Subjects: “…Intelligent water drops algorithm…”
Conference Paper -
9
Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan
Published 1997“…Searching for possible abutment between the transistor pairs are modelled as a bipartite graph. A depth - first search algorithm is used to search for optimal chaining. …”
Get full text
Get full text
Thesis -
10
African Buffalo Optimization (ABO): A New Metaheuristic Algorithm
Published 2015“…The African Buffalo Optimization (A.B.0) algorithm simulates the African buffalos' behaviour by encapsulation in a mathematical model; which solves a number of discrete optimization problems using graph-based route planning, job scheduling and it extends Swarm Intelligence paradigms. …”
Get full text
Get full text
Get full text
Article -
11
Multi-robot path planning based on the improved nutcracker optimization algorithm and the dynamic window approach
Published 2024“…This paper proposes a multi-robot path planning algorithm that integrates the improved nutcracker optimization algorithm with the improved dynamic window approach. …”
Get full text
Get full text
Get full text
Article -
12
Stochastic partially optimized cyclic shift crossover for multi-objective genetic algorithms for the vehicle routing problem with time-windows
Published 2017“…This paper presents a stochastic partially optimized cyclic shift crossover operator for the optimization of the multi-objective vehicle routing problem with time windows using genetic algorithms. …”
Get full text
Get full text
Article -
13
Intelligent Examination Timetabling System Using Hybrid Intelligent Water Drops Algorithm
Published 2024Subjects:Proceedings Paper -
14
Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article
Published 2010“…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
Get full text
Get full text
Article -
15
Approximate methods for minimum vertex cover fail to provide optimal results on small graph instances: A review
Published 2018“…The key contribution of this paper is the provision of small benchmark graphs on which the given approximation algorithms fail to provide optimal results. …”
Get full text
Get full text
Get full text
Get full text
Article -
16
Modified And Ensemble Intelligent Water Drop Algorithms And Their Applications
Published 2015“…The Intelligent Water Drop (IWD) algorithm is a swarm-based model that is useful for undertaking optimization problems. …”
Get full text
Get full text
Thesis -
17
Graph-Based Algorithm With Self-Weighted And Adaptive Neighbours Learning For Multi-View Clustering
Published 2024“…To address this issue, this study incorporated joint graph learning from the gmc algorithm into swmcan, creating a new algorithm called swmcan-jg. …”
Get full text
Get full text
Thesis -
18
Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator
Published 2010“…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
Get full text
Get full text
Student Project -
19
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 -
20
VISUALIZATION OF GENETIC ALGORITHM BASED ON 2-D GRAPH TO ACCELERATE THE SEARCHING WITH HUMAN INTERVENTIONS.
Published 2012“…It is noted that active user intervention increases the acceleration of Genetic Algorithm towards an optimal solution. In proposed research work, the user is aided by a visualization based on the representation of multidimensional Genetic Algorithm data on 2-0 space. …”
Get full text
Get full text
Thesis
