380 search results - page 54 / 76 » Cluster Graphs as Abstractions for Constraint Satisfaction P... |
STOC
2006
ACM
14 years 9 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
VIZSEC
2005
Springer
14 years 2 months ago
2005
Springer
While efficient graph-based representations have been developed for modeling combinations of low-level network attacks, relatively little attention has been paid to effective tech...
AAAI
2007
13 years 11 months ago
2007
Finding the exact treewidth of a graph is central to many operations in a variety of areas, including probabilistic reasoning and constraint satisfaction. Treewidth can be found b...
CP
2008
Springer
13 years 10 months ago
2008
Springer
ctural abstractions that were introduced in [17]. Compared with other symmetry-breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodate dynami...
CP
2007
Springer
14 years 17 days ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...