Search alternatives:
4_using algorithm » cosine algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
data algorithm » jaya algorithm (Expand Search), deer algorithm (Expand Search)
element » elements (Expand Search)
4_using algorithm » cosine algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
data algorithm » jaya algorithm (Expand Search), deer algorithm (Expand Search)
element » elements (Expand Search)
-
1
An algorithm for solving bond pricing problem
Published 2002Get full text
Get full text
Get full text
Get full text
article -
2
Genetic Algorithm Analysis using the Graph Coloring Method for Solving the University Timetable Problem
Published 2018“…Genetic algorithms were successfully useful to solve many optimization problems including the university Timetable Problem. …”
Get full text
Get full text
Get full text
Get full text
article -
3
An evolutionary algorithm for solving the geometrically constrained site layout problem
Published 2017“…This paper presents an investigation of applying an evolutionary approach to optimally solve the aforementioned layout problem. The proposed algorithm is two-phases: an initialization phase that generates an initial population of layouts through a sequence of mutation operations, and a reproduction phase that evolve the layouts generated in phase one through a sequence of genetic operations aiming at finding an optimal layout. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
4
Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem
Published 1998“…This paper describes a hybrid algorithm that combines an adaptive-type neural network algorithm and a nondeterministic iterative algorithm to solve the Euclidean traveling salesman problem (E-TSP). …”
Get full text
Get full text
article -
5
Modified clarke wright algorithms for solving the realistic vehicle routing problem
Published 2015Get full text
Get full text
Get full text
Get full text
conferenceObject -
6
Genetic Algorithm for Solving Site Layout Problem with Unequal-Size and Constrained Facilities
Published 2002“…This paper presents an investigation of the applicability of a genetic approach for solving the construction site layout problem. This problem involves coordinating the use of limited site space to accommodate temporary facilities so that transportation cost of materials is minimized. …”
Get full text
Get full text
Get full text
article -
7
-
8
-
9
Bird’s Eye View feature selection for high-dimensional data
Published 2023“…This approach is inspired by the natural world, where a bird searches for important features in a sparse dataset, similar to how a bird search for sustenance in a sprawling jungle. BEV incorporates elements of Evolutionary Algorithms with a Genetic Algorithm to maintain a population of top-performing agents, Dynamic Markov Chain to steer the movement of agents in the search space, and Reinforcement Learning to reward and penalize agents based on their progress. …”
-
10
Capturing outline of fonts using genetic algorithm and splines
Published 2001“…We present a method to convert the original problem into a discrete combinatorial optimization problem and solve it by a genetic algorithm. We also incorporate a corner detection algorithm to detect significant points which are necessary to capture a pleasant looking spline fitting for shapes such as fonts. …”
Get full text
Get full text
article -
11
A method for the minimum coloring problem using genetic algorithms
Published 2006“…This paper presents a method to solve the graph coloring problem for arbitrary graphs using genetic algorithms. …”
Get full text
Get full text
Get full text
conferenceObject -
12
Optimal VAR Dispatch Using a Multiobjective Evolutionary Algorithm
Published 2005Get full text
article -
13
-
14
A method for test scheduling using an evolutionary approach. (c2000)
Published 2000Get full text
Get full text
masterThesis -
15
-
16
A Neural Networks Algorithm for the Minimum Colouring Problem Using FPGAs†
Published 2010“…This paper presents a hardware implementation to solve the graph colouring problem (chromatic number χ(G)) for arbitrary graphs using the Hopfield neural network (HNN) model of computation. …”
Get full text
Get full text
Get full text
article -
17
-
18
-
19
A Stochastic Approach To Solving The Weight Setting Problem in OSPF Networks
Published 2007Get full text
masterThesis -
20
A matheuristic approach for solving the 2-connected dominating set problem
Published 2019“…<p dir="ltr">This paper describes a matheuristic approach for solving the 2-connected dominating set problem (2-CDS). …”