Search alternatives:
method algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
colony » colon (Expand Search)
method algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (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
A Multiswarm Intelligence Algorithm for Expensive Bound Constrained Optimization Problems
Published 2021“…The test suite of benchmark function is recently designed for the special session of EAs competition in IEEE Congress on Evolutionary Computation (IEEE-CEC′13). The suggested algorithm has approximated promising solutions with good convergence and diversity maintenance for most of the used bound constrained single optimization problems. …”
-
4
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 -
5
A reduced model for phase-change problems with radiation using simplified PN approximations
Published 2025“…The integro-differential equation for the full radiative transfer is replaced by a set of differential equations which are independent of the angle variable and easy to solve using conventional computational methods. To solve the coupled equations, we implement a second-order implicit scheme for the time integration and a mixed finite element method for the space discretization. …”
Get full text
article -
6
-
7
A parallel ant colony optimization to globally optimize area in high-level synthesis. (c2011)
Published 2011Get full text
Get full text
masterThesis -
8
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 -
9
Bee colony algorithm for assigning proctors to exams. (c2013)
Published 2013Get full text
Get full text
masterThesis -
10
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 -
11
An algorithm for solving bond pricing problem
Published 2002Get full text
Get full text
Get full text
Get full text
article -
12
Kernelization algorithms for the vertex cover problem
Published 2017Get full text
Get full text
Get full text
conferenceObject -
13
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 -
14
Brain Source Localization in the Presence of Leadfield Perturbations
Published 2015Get full text
doctoralThesis -
15
A GLOBAL ALGORITHM FOR THE FUZZY CLUSTERING PROBLEM
Published 2020“…The global minimum solution of the problem is found using a simulated annealing-based algorithm. …”
Get full text
article -
16
Scalable parallel algorithms for difficult combinatorial problems
Published 2004“…These complementary tools and technologies are used to launch systematic attacks on combinatorial problems of significance. …”
Get full text
Get full text
Get full text
conferenceObject -
17
A Parallel Genetic Algorithm for the Open-Shop Scheduling Problem Using Deterministic and Random Moves
Published 2016“…This paper investigates the use of parallel genetic algorithms in order to solve the open-shop scheduling problem. …”
Get full text
Get full text
Get full text
article -
18
Portfolio Selection Problem Using CVaR Risk Measures Equipped with DEA, PSO, and ICA Algorithms
Published 2022“…Since the search space is vast in actual markets and there are limitations such as the number of assets and their weight, the optimization problem becomes difficult. Evolutionary algorithms are a powerful tool to deal with these difficulties. …”
-
19
A kernelization algorithm for d-Hitting Set
Published 2010“…Our method is used also to obtain quadratic kernels for several other problems. …”
Get full text
Get full text
Get full text
article -
20
An Evolutionary Algorithm for the Allocation Problem in High-Level Synthesis
Published 2005“…This paper presents an evolutionary algorithm to solve the datapath allocation problem in high-level synthesis. …”
Get full text
Get full text
Get full text
article