156 search results - page 13 / 32 » Another Complete Local Search Method for SAT |
C3S2E
2010
ACM
13 years 8 months ago
2010
ACM
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
ENGL
2006
13 years 7 months ago
2006
Hybrid genetic algorithms have received significant interest in recent years and are being increasingly used to solve real-world problems. A genetic algorithm is able to incorporat...
JCIT
2010
13 years 2 months ago
2010
For stationary or quasi-stationary frames of a video sequence, traditional block matching algorithms (BMA) will easily lead the search to be trapped into a local minimum. In this ...
DAM
2008
13 years 7 months ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
AAAI
2000
13 years 9 months ago
2000
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guarante...