Search alternatives:
processing algorithm » processing algorithms (Expand Search)
waste processing » image processing (Expand Search), text processing (Expand Search), melt processing (Expand Search)
would algorithm » mould algorithm (Expand Search)
search » research (Expand Search)
processing algorithm » processing algorithms (Expand Search)
waste processing » image processing (Expand Search), text processing (Expand Search), melt processing (Expand Search)
would algorithm » mould algorithm (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
Improved search-tree algorithms for the cluster edit problem. (c2011)
Published 2011Get full text
Get full text
masterThesis -
3
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 -
4
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 -
5
A decentralized load balancing strategy for parallel search-three optimization. (c2010)
Published 2010Get full text
Get full text
masterThesis -
6
A parallel search tree algorithm for vertex cover on graphical processing units. (c2013)
Published 2013Get full text
Get full text
masterThesis -
7
A Scatter search algorithm for exam scheduling. (c2006)
Published 2006Get full text
Get full text
masterThesis -
8
-
9
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 -
10
Matheuristic Fixed Set Search Applied to the Two-Stage Capacitated Facility Location Problem
Published 2025Subjects: -
11
Scatter search for protein structure prediction. (c2008)
Published 2008Get full text
Get full text
masterThesis -
12
Physical optimization algorithms for mapping data to distributed-memory multiprocessors
Published 1992“…We present three parallel physical optimization algorithms for mapping data to distributed-memory multiprocessors, concentrating on irregular loosely synchronous problems. …”
Get full text
Get full text
Get full text
masterThesis -
13
A fast exact sequential algorithm for the partial digest problem
Published 2016“…Two types of simulated data, random and Zhang, are used to measure the efficiency of the algorithm. …”
-
14
Genetic and heuristic algorithms for regrouping service sites. (c2000)
Published 2000Get full text
Get full text
masterThesis -
15
-
16
A genetic algorithm for corrective retesting. (c1995)
Published 1995Get full text
Get full text
masterThesis -
17
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. …”
-
18
Scatter search for homology modeling
Published 2016“…To improve homology based PSP, we propose a scatter search (SS) metaheuristic algorithm. SS is an evolutionary approach that is based on a population of candidate solutions. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
19
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. …”
-
20
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