13 search results - page 1 / 3 » Backbone Guided Local Search for Maximum Satisfiability |
IJCAI
2003
13 years 5 months ago
2003
Maximum satisfiability (Max-SAT) is more general and more difficult to solve than satisfiability (SAT). In this paper, we first investigate the effectiveness of Walksat, one of th...
JAIR
2000
13 years 4 months ago
2000
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
KR
2004
Springer
13 years 9 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
AAAI
2004
13 years 5 months ago
2004
Tabu search algorithms are amongst the most successful local search based methods for the maximum satisfiability problem. The practical superiority of tabu search over the local s...
ICCV
2009
IEEE
14 years 9 months ago
2009
IEEE
We present some theoretical results related to the problem
of actively searching for a target in a 3D environment,
under the constraint of a maximum search time. We define
the o...