Search alternatives:
method algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
derived using » delivery using (Expand Search)
search » research (Expand Search)
method algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
derived using » delivery using (Expand Search)
search » research (Expand Search)
-
1
A Tabu Search algorithm for mapping data to multicomputers. (c1997)
Published 1997Get full text
Get full text
masterThesis -
2
Efficient Approximate Conformance Checking Using Trie Data Structures
Published 2021“…By encoding the proxy behavior using a trie data structure, we obtain a logarithmically reduced search space for alignment computation compared to a set-based representation. …”
Get full text
Get full text
Get full text
-
3
Improved search-tree algorithms for the cluster edit problem. (c2011)
Published 2011Get full text
Get full text
masterThesis -
4
Stochastic Search Algorithms for Exam Scheduling
Published 2007“…In this work, we use a modified weighted-graph coloring problem formulation and adapt two stochastic search algorithms for solving the problem. The two algorithms are a simulated annealing algorithm (SA) and a genetic algorithm (GA). …”
Get full text
Get full text
article -
5
Scatter Search algorithm for Protein Structure Prediction
Published 2016“…In this paper, we present a Scatter Search (SS) algorithm for predicting 3D structures of proteins based on torsion angles representation. …”
Get full text
Get full text
Get full text
article -
6
A multi-class discriminative motif finding algorithm for autosomal genomic data. (c2015)
Published 2016“…Then, it searches for population discriminative motifs or differentiable sequence of SNPs, by implementing Probabilistic Suffix Trees data structures. …”
Get full text
Get full text
masterThesis -
7
A decentralized load balancing strategy for parallel search-three optimization. (c2010)
Published 2010Get full text
Get full text
masterThesis -
8
A parallel search tree algorithm for vertex cover on graphical processing units. (c2013)
Published 2013Get full text
Get full text
masterThesis -
9
Bird’s Eye View feature selection for high-dimensional data
Published 2023“…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
A Scatter search algorithm for exam scheduling. (c2006)
Published 2006Get full text
Get full text
masterThesis -
11
-
12
The buffered work-pool approach for search-tree based optimization algorithms
Published 2017“…This new trend has been motivated by hardness of approximation results that appeared in the last decade, and has taken a great boost by the emergence of parameterized complexity theory. Exact algorithms often follow the classical search-tree based recursive backtracking strategy. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
13
-
14
Matheuristic Fixed Set Search Applied to the Two-Stage Capacitated Facility Location Problem
Published 2025Subjects: -
15
Scatter search for protein structure prediction. (c2008)
Published 2008Get full text
Get full text
masterThesis -
16
-
17
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 -
18
Recent Advances of Chimp Optimization Algorithm: Variants and Applications
Published 2023“…It has been widely tailored for a wide variety of optimization problems due to its impressive characteristics over other swarm intelligence methods: it has very few parameters, and no derivation information is required in the initial search. …”
Get full text
-
19
-
20