858 search results - page 172 / 172 » A Glimpse of Constraint Satisfaction |
119
Voted
CONEXT
2010
ACM
14 years 12 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...
123
Voted
CP
2010
Springer
14 years 12 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...
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...