Abstract: In this paper, through combining the advantages of genetic algorithm and tabu search algorithm, a new algorithm called genetic tabu search (GTS) to obtain even-variable Boolean functions ...
Abstract: Boolean satisfiability (SAT), the first proven nondeterministic polynominal-complete problem, is crucial in dataintensive applications. Different applications have a wide spectrum of SAT ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results