63 search results - page 3 / 13 » A New Algorithm for Sampling CSP Solutions Uniformly at Rand... |
GECCO
2009
Springer
13 years 11 months ago
2009
Springer
We benchmark the Pure-Random-Search algorithm on the BBOB 2009 noisy testbed. Each candidate solution is sampled uniformly in [−5, 5]D , where D denotes the search space dimensi...
SAT
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
PVLDB
2008
13 years 5 months ago
2008
We study selectivity estimation techniques for set similarity queries. A wide variety of similarity measures for sets have been proposed in the past. In this work we concentrate o...
SPIRE
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...
AI
2005
Springer
13 years 6 months ago
2005
Springer
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...