Sciweavers

2917 search results - page 197 / 584
» Satisfying Interaction Constraints
Sort
View
CP
2008
Springer
15 years 8 months ago
Probabilistically Estimating Backbones and Variable Bias: Experimental Overview
Backbone variables have the same assignment in all solutions to a given constraint satisfaction problem; more generally, bias represents the proportion of solutions that assign a v...
Eric I. Hsu, Christian J. Muise, J. Christopher Be...
APPROX
2010
Springer
147views Algorithms» more  APPROX 2010»
15 years 8 months ago
Approximate Lasserre Integrality Gap for Unique Games
In this paper, we investigate whether a constant round Lasserre Semi-definite Programming (SDP) relaxation might give a good approximation to the UNIQUE GAMES problem. We show tha...
Subhash Khot, Preyas Popat, Rishi Saket
SPLC
2008
15 years 8 months ago
Enabling Verifiable Conformance for Product Lines
NASA is, with the rest of industry, turning to product-line engineering to reduce costs and improve quality by effectively managing reuse. Experience in industry has shown that it...
Robyn R. Lutz
CASCON
2004
108views Education» more  CASCON 2004»
15 years 8 months ago
Consistent query answering under inclusion dependencies
For several reasons a database may not satisfy certain integrity constraints (ICs), for example, when it is the result of integrating several independent data sources. However, mo...
Loreto Bravo, Leopoldo E. Bertossi
IJCAI
2001
15 years 8 months ago
The Levelwise Version Space Algorithm and its Application to Molecular Fragment Finding
A tight integration of Mitchell's version space algorithm with Agrawal et al.'s Apriori algorithm is presented. The algorithm can be used to generate patterns that satis...
Luc De Raedt, Stefan Kramer