470 search results - page 11 / 94 » Tabu Search for SAT |
SAT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Polynomial interpretations are one of the most popular techniques for automated termination analysis and the search for such interpretations is a main bottleneck in most ...
ATMOS
2010
13 years 5 months ago
2010
In the traveling repairman problem with profits, a repairman (also known as the server) visits a subset of nodes in order to collect time-dependent profits. The objective consists...
DATE
2007
IEEE
14 years 1 months ago
2007
IEEE
Due to the widespread demands for efficient SAT solvers in Electronic Design Automation applications, methods to boost the performance of the SAT solver are highly desired. We pr...
IJCAI
2003
13 years 9 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...
KBSE
2003
IEEE
14 years 24 days ago
2003
IEEE
The use of techniques for automating the generation of software test cases is very important as it can reduce the time and cost of this process. The latest methods for automatic g...