156 search results - page 12 / 32 » Another Complete Local Search Method for SAT |
CP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...
TAINN
2005
Springer
14 years 1 months ago
2005
Springer
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...
CP
2005
Springer
14 years 1 months ago
2005
Springer
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
ICTAI
2006
IEEE
14 years 1 months ago
2006
IEEE
Standard tabu search methods are based on the complete exploration of current solution neighborhood. However, for some problems with very large neighborhood or time-consuming eval...
AAAI
2006
13 years 9 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...