Abstract:
This study presents an evolutionary approach to solve the test-scheduling problem in
VLSI circuits.
Test Scheduling is an NP-complete problem and, in order to solve it, genetic
algorithms are used. The number of cliques obtained after running the algorithm
several times is the optimal solution.
The convergence of the algorithm is evaluated using a set of examples. These tests
indicate that the convergence rate is adequate and, therefore, validate the approach
taken.
