Search alternatives:
using algorithm » cosine algorithm (Expand Search)
element based » event based (Expand Search)
colony » colon (Expand Search)
using algorithm » cosine algorithm (Expand Search)
element based » event based (Expand Search)
colony » colon (Expand Search)
-
1
-
2
Bee Colony Algorithm for Proctors Assignment.
Published 2015“…The search accomplished by three types of bees over a number of iterations aiming to find the source with the highest nectar value (fitness value of a candidate solution). We apply the Bee Colony algorithm to previously published data. Experimental results show good solutions that maximize the preferences of proctors while preserving the fairness of the workload given to proctors. …”
Get full text
Get full text
Get full text
article -
3
-
4
An algorithm for solving bond pricing problem
Published 2002Get full text
Get full text
Get full text
Get full text
article -
5
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 -
6
Bee colony algorithm for assigning proctors to exams. (c2013)
Published 2013Get full text
Get full text
masterThesis -
7
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 -
8
An ant colony optimization algorithm to improve software quality prediction models
Published 2011“…We use an ant colony optimization algorithm in the adaptation process. …”
Get full text
Get full text
Get full text
article -
9
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 -
10
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 -
11
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 -
12
A parallel ant colony optimization to globally optimize area in high-level synthesis. (c2011)
Published 2011Get full text
Get full text
masterThesis -
13
Sensitivity analysis and genetic algorithm-based shear capacity model for basalt FRC one-way slabs reinforced with BFRP bars
Published 2023“…Finally, a design equation that can predict the shear capacity of one-way BFRC-BFRP slabs was proposed based on genetic algorithm. The proposed model showed the best prediction accuracy compared to the available design codes and guidelines with a mean of predicted to experimental shear capacities (V<sub>pred</sub>/V<sub>exp</sub>) ratio of 0.97 and a coefficient of variation of 17.91%.…”
-
14
Design of adaptive arrays based on element position perturbations
Published 1993Get full text
Get full text
article -
15
A Parallel Neural Networks Algorithm for the Clique Partitioning Problem
Published 2002“…In this paper we present a parallel algorithm to solve the above problem for arbitrary graphs using a Hopfield Neural Network model of computation. …”
Get full text
Get full text
article -
16
Evolutionary algorithms for state justification in sequential automatic test pattern generation
Published 2005“…A common search operation in sequential Automatic Test Pattern Generation is to justify a desired state assignment on the sequential elements. State justification using deterministic algorithms is a difficult problem and is prone to many backtracks, which can lead to high execution times. …”
Get full text
article -
17
-
18
-
19
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 -
20
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