Search alternatives:
testing algorithm » cosine algorithm (Expand Search)
method algorithm » mould algorithm (Expand Search)
search » research (Expand Search)
testing algorithm » cosine algorithm (Expand Search)
method algorithm » mould algorithm (Expand Search)
search » research (Expand Search)
-
1
A genetic algorithm for corrective retesting. (c1995)
Published 1995Get full text
Get full text
masterThesis -
2
A Tabu Search algorithm for mapping data to multicomputers. (c1997)
Published 1997Get full text
Get full text
masterThesis -
3
-
4
Metaheuristic Algorithm for State-Based Software Testing
Published 2018“…This article presents a metaheuristic algorithm for testing software, especially web applications, which can be modeled as a state transition diagram. …”
Get full text
Get full text
Get full text
Get full text
article -
5
-
6
Evolutionary algorithms for state justification in sequential automatic test pattern generation
Published 2005“…Sequential circuit test generation using deterministic, fault-oriented algorithms is highly complex and time consuming. …”
Get full text
article -
7
Physical optimization algorithms for mapping data to distributed-memory multiprocessors
Published 1992“…The technique proposed for large problems is based on a pre-mapping graph contraction heuristic algorithm, which results in a smaller search space. …”
Get full text
Get full text
Get full text
masterThesis -
8
Web Applications Security Testing: Genetic Algorithms Based Test Data Generator
Published 2020Get full text
masterThesis -
9
Efficient static test compaction algorithms for combinational circuits based on test relaxation
Published 2003Get full text
masterThesis -
10
Improved search-tree algorithms for the cluster edit problem. (c2011)
Published 2011Get full text
Get full text
masterThesis -
11
-
12
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 -
13
Test Vector Decomposition Based Static Compaction Algorithms for Combinational Circuits
Published 2003“…In this paper, a new approach to static compaction for combinational circuits, referred to as test vector decomposition (TVD), is proposed. In addition, two new TVD based static compaction algorithms are presented. …”
Get full text
article -
14
A Multiswarm Intelligence Algorithm for Expensive Bound Constrained Optimization Problems
Published 2021“…The suggested algorithm integrates the SI-based algorithms to evolve population and handle exploration versus exploitation issues. …”
-
15
Data Generation for Path Testing
Published 2004“…These algorithms are based on an optimization formulation of the path testing problem which include both integer- and real-value test cases. …”
Get full text
Get full text
Get full text
article -
16
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 -
17
Incremental and Heuristic Algorithms for Deriving Adaptive Distinguishing Test Cases for Nondeterministic Finite State Machines
Published 2017Subjects: “…Model Based Testing…”
Get full text
doctoralThesis -
18
A decentralized load balancing strategy for parallel search-three optimization. (c2010)
Published 2010Get full text
Get full text
masterThesis -
19
A parallel search tree algorithm for vertex cover on graphical processing units. (c2013)
Published 2013Get full text
Get full text
masterThesis -
20
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. …”