5138 search results - page 441 / 1028 » Randomized Algorithms for 3-SAT |
180
Voted
FSTTCS
2004
Springer
16 years 7 days ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
184
Voted
WEA
2004
Springer
16 years 5 days ago
2004
Springer
This paper describes a GRASP with path-relinking heuristic for the quadratic assignment problem. GRASP is a multi-start procedure, where different points in the search space are p...
170
click to vote
COCO
2001
Springer
15 years 11 months ago
2001
Springer
We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp 3-...
174
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
Given two binary linear codes R and C, their tensor product R C consists of all matrices with rows in R and columns in C. We analyze the "robustness" of the following te...
187
click to vote
DCOSS
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We are interested in the problem of computing the average consensus in a distributed fashion on random geometric graphs. We describe a new algorithm called Multi-scale Go...