Search Results - (( java application optimization algorithm ) OR ( dynamic selection based algorithm ))
Search alternatives:
- application optimization »
- dynamic selection »
- java application »
- selection based »
-
1
Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection
Published 2022“…Therefore, in this paper, we proposed Dynamic tasks scheduling algorithm based on attribute reduction with an enhanced hybrid Genetic Algorithm and Particle Swarm Optimization for optimal device selection. …”
Get full text
Get full text
Article -
2
Ant colony optimization algorithm for load balancing in grid computing
Published 2012“…EACO selects the resources based on the pheromone value on each resource which is recorded in a matrix form. …”
Get full text
Get full text
Get full text
Monograph -
3
Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing
Published 2011“…EACO selects the resources based on the pheromone value on each resource which is recorded in a matrix form. …”
Get full text
Get full text
Get full text
Thesis -
4
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 -
5
Optimization of blood vessel detection in retina images using multithreading and native code for portable devices
Published 2013Get full text
Get full text
Conference or Workshop Item -
6
Performance evaluation of real-time multiprocessor scheduling algorithms
Published 2016“…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
Get full text
Get full text
Conference or Workshop Item -
7
Route Optimization System
Published 2005“…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
Get full text
Get full text
Final Year Project -
8
Dynamic Bayesian Networks and Variable Length Genetic Algorithm for Dialogue Act Recognition
Published 2007“…In the initial stage, the dynamic Bayesian networks models are constructed based on a set of lexical cues selected tentatively from the dialogue corpus. …”
Get full text
Get full text
Thesis -
9
-
10
Dynamic Probability Selection for Flower Pollination Algorithm based on Metropolis-hastings Criteria
Published 2021“…This paper proposed flower pollination algorithm metropolis-hastings (FPA-MH) based on the adoption of Metropolis-Hastings criteria adopted from the Simulated Annealing (SA) algorithm to enable dynamic selection of the pa probability. …”
Get full text
Get full text
Article -
11
Dynamic probability selection for flower pollination algorithm based on metropolis-hastings criteria
Published 2021“…This paper proposed flower pollination algorithm metropolis-hastings (FPA-MH) based on the adoption of Metropolis-Hastings criteria adopted from the Simulated Annealing (SA) algorithm to enable dynamic selection of the pa probability. …”
Get full text
Get full text
Get full text
Article -
12
Dynamic Bayesian networks and variable length genetic algorithm for designing cue-based model for dialogue act recognition
Published 2010“…In the second stage, the developed variable length genetic algorithm is used to select different sets of lexical cues to constitute the dynamic Bayesian networks' random variables. …”
Get full text
Get full text
Article -
13
A novel clustering based genetic algorithm for route optimization
Published 2016“…It was also observed that the introduction of clustering based selection algorithm guaranteed the selection of cluster with the optimal solution in every generation. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article -
14
Enhancement Of Cover Selection – Based Audio Steganography (CAS) Using Block-Based Chaotic Multi – Level Lsb (BCM– LSB) For Balanced Performance
Published 2024thesis::doctoral thesis -
15
Model structure selection for a discrete-time non-linear system using genetic algorithm
Published 2004“…They offer many advantages such as global search characteristics, and this has led to the idea of using this programming method in modelling dynamic non-linear systems. In this paper, a methodology for model structure selection based on a genetic algorithm was developed and applied to non-linear discrete-time dynamic systems. …”
Get full text
Get full text
Get full text
Article -
16
Model structure selection for a discrete-time non-linear system using a genetic algorithm
Published 2004“…They offer many advantages such as global search characteristics, and this has led to the idea of using this programming method in modelling dynamic non-linear systems. In this paper, a methodology for model structure selection based on a genetic algorithm was developed and applied to non-linear discrete-time dynamic systems. …”
Get full text
Get full text
Article -
17
Model structure selection for a discrete-time non-linear system using a genetic algorithm
Published 2004“…They offer many advantages such as global search characteristics, and this has led to the idea of using this programming method in modelling dynamic non-linear systems. In this paper, a methodology for model structure selection based on a genetic algorithm was developed and applied to non-linear discrete-time dynamic systems. …”
Get full text
Get full text
Article -
18
Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem
Published 2021“…Capacitated Multi-source Weber Problem (CMSWP) is a type of Location Allocation Problem (LAP) which have been extensively researched because they can be applied in a variety of contexts. Random selection of facility location in a Cell-based approach may cause infeasible or worse solutions. …”
Get full text
Get full text
Thesis -
19
Effects of user selected conditions on modeling of dynamic systems using adaptive fuzzy model
Published 2001“…In this paper, major properties of an adaptive fuzzy model as a system identifier when trained by the back-propagation algorithm are discussed. The standard rule-based fuzzy models were used to identify discrete-time nonlinear dynamic systems. …”
Get full text
Get full text
Get full text
Article -
20
