283 search results - page 37 / 57 » Solving Over-Constrained Problems with SAT |
ORL
2008
13 years 9 months ago
2008
We define a generalized variant of the satisfiability problem (SAT) where each "clause" is an or-list of inequalities in n variables. The inequality satisfiability probl...
LPAR
2005
Springer
14 years 2 months ago
2005
Springer
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
DATE
2004
IEEE
14 years 27 days ago
2004
IEEE
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
CP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...
PCM
2004
Springer
14 years 2 months ago
2004
Springer
We propose and describe a novel video capturing system called Sat-Cam that can observe and record the users’ activity from effective viewpoints to negate the effects of unstead...