980 search results - page 196 / 196 » Decentralized Constraint Satisfaction |
141
click to vote
SODA
2010
ACM
15 years 4 days ago
2010
ACM
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...
119
click to vote
CONEXT
2010
ACM
14 years 11 months ago
2010
ACM
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...
121
Voted
CP
2010
Springer
14 years 11 months ago
2010
Springer
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...
140
click to vote
SENSYS
2010
ACM
14 years 11 months ago
2010
ACM
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...
106
click to vote
FOCS
2004
IEEE
15 years 5 months ago
2004
IEEE
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...