Search alternatives:
modeling algorithm » scheduling algorithm (Expand Search)
spatial modeling » statistical modeling (Expand Search)
data algorithms » jaya algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
modeling algorithm » scheduling algorithm (Expand Search)
spatial modeling » statistical modeling (Expand Search)
data algorithms » jaya algorithm (Expand Search)
using algorithm » cosine algorithm (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
Spatially-Distributed Missions With Heterogeneous Multi-Robot Teams
Published 2021“…Both combine a generic MILP solver and a genetic algorithm, resulting in efficient anytime algorithms. …”
-
7
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 -
8
Variable Selection in Data Analysis: A Synthetic Data Toolkit
Published 2024“…Variable (feature) selection plays an important role in data analysis and mathematical modeling. This paper aims to address the significant lack of formal evaluation benchmarks for feature selection algorithms (FSAs). …”
Get full text
article -
9
CoLoSSI: Multi-Robot Task Allocation in Spatially-Distributed and Communication Restricted Environments
Published 2024“…<p dir="ltr">In our research, we address the problem of coordination and planning in heterogeneous multi-robot systems for missions that consist of spatially localized tasks. Conventionally, this problem has been framed as a task allocation problem that maps tasks to robots. …”
-
10
-
11
-
12
UniBFS: A novel uniform-solution-driven binary feature selection algorithm for high-dimensional data
Published 2024“…UniBFS exploits the inherent characteristic of binary algorithms-binary coding-to search the entire problem space for identifying relevant features while avoiding irrelevant ones. …”
-
13
Auto-indexing Arabic texts based on association rule data mining. (c2015)
Published 2015“…Our model denotes extracting new relevant words by relating those chosen by the previous classical methods, to new words using data mining rules. …”
Get full text
Get full text
masterThesis -
14
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 -
15
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 -
16
Optimal VAR Dispatch Using a Multiobjective Evolutionary Algorithm
Published 2005Get full text
article -
17
-
18
A method for test scheduling using an evolutionary approach. (c2000)
Published 2000Get full text
Get full text
masterThesis -
19
-
20
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