AINeutralarXiv – CS AI · 5h ago5/10
🧠
A Study of Parallel Continuous Local Search
Researchers present an empirical study of parallel Continuous Local Search (CLS) as a method for solving Boolean satisfiability problems with pseudo-Boolean constraints. Key findings reveal that redundant constraints can slow convergence, CLS shows promise as a hybrid solver component, and local search quickly plateaus due to saddle-dense optimization landscapes.