Sciweavers

980 search results - page 196 / 196
» Decentralized Constraint Satisfaction
Sort
View
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
13 years 3 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...
CONEXT
2010
ACM
13 years 3 months ago
NEVERMIND, the problem is already fixed: proactively detecting and troubleshooting customer DSL problems
Traditional DSL troubleshooting solutions are reactive, relying mainly on customers to report problems, and tend to be labor-intensive, time consuming, prone to incorrect resoluti...
Yu Jin, Nick G. Duffield, Alexandre Gerber, Patric...
CP
2010
Springer
13 years 3 months ago
The Lattice Structure of Sets of Surjective Hyper-Operations
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...
Barnaby Martin
SENSYS
2010
ACM
13 years 3 months ago
PipeProbe: a mobile sensor droplet for mapping hidden pipeline
This paper presents PipeProbe, a mobile sensor system for determining the spatial topology of hidden water pipelines behind walls. PipeProbe works by dropping a tiny wireless sens...
Tsung-Te Lai, Yu-Han Chen, Polly Huang, Hao-Hua Ch...
FOCS
2004
IEEE
13 years 9 months ago
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...
Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O...