102 search results - page 4 / 21 » A Stochastic Local Search Approach to Vertex Cover |
CSR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
84
Voted
IBPRIA
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. This paper deals with a compact catadioptric omnidirectional stereovision system based on a single camera and multi-mirrors (at least two mirrors). Many configurations w...
82
Voted
AI
2003
Springer
15 years 2 months ago
2003
Springer
Sets of DNA strands that satisfy combinatorial constraints play an important role in various approaches to biomolecular computation, nanostructure design, and molecular tagging. Th...
DAM
2000
14 years 9 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
JSAT
2010
14 years 4 months ago
2010
In this paper we analyze three well-known preprocessors for Max-SAT. The first preprocessor is based on the so-called variable saturation. The second preprocessor is based on the ...