Sciweavers

2 search results - page 1 / 1
» tainn 2005
Sort
View
TAINN
2005
Springer
14 years 27 days ago
An Evolutionary Local Search Algorithm for the Satisfiability Problem
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
Levent Aksoy, Ece Olcay Gunes